Para receber por e-mail novas publicações de Seminário de Probabilidade e Combinatória, Clique Aqui!

Seminários do IMPA

Probabilidade e Combinatória

Extreme eigenvalues of Erdös-Rényi graphs
Florent Benaych-Georges

Université Paris Descarte
Segunda-feira, 5 de fevereiro de 2018, 15:30
Sala 228

In this talk, we shall present some recent works with Charles Bordenave and Antti Knowles giving estimates for the extreme eigenvalues of the centered adjacency matrices of a possibly inhomogenous Erdös-Rényi graph. In the case of the Stochastic Block Model, these works allow to assess the accuracy of the spectral clustering algorithm, whereas in the case of an homogenous Erdös-Rényi graph, they establish a transition between a compact spectrum and a diffuse one, at a threshold which coincides with the connectivity threshold.