Abstract
During the discussion on Monday afternoon, the audience will select a talk to continue on Tuesday morning.
In this talk I will re-state the results presented yesterday in my talk, concerning the recovery of the communities in the stochastic block model. I will spend some time on the connection between coding and clustering network models with latent variables. If time allows, I will discuss the algorithms and proofs, in particular our algorithms that recover clusters with quasi-linear time in the constant and logarithmic degree regimes.