MATH-602 / 3 crédits

Enseignant(s): Abbé Emmanuel, Berthier Raphaël Jean

Langue: Anglais


Frequency

Every year

Summary

The class covers topics related to statistical inference and algorithms on graphs: basic random graphs concepts, thresholds, subgraph containment (planted clique), connectivity, broadcasting on trees, stochastic block models and perceptron models. Requirement: basics of probability and statistics.

Content

Keywords

Inference on graphs, learning on graphs, random graphs, community detecion, clustering, perceptron, neural networks, spectral graph theory.

Learning Prerequisites

Required courses

A basic class on probability and statistics

Learning Outcomes

  • Understand the material of the class and related papers.

Resources

Bibliography

Notes on "Random graphs" and monograph on "Community detection and stochastic block models" by E. Abbe. List of papers.

Ressources en bibliothèque

Dans les plans d'études

  • Forme de l'examen: Oral (session libre)
  • Matière examinée: Inference on graphs
  • Cours: 20 Heure(s)
  • TP: 40 Heure(s)

Semaine de référence