GdTProbaTESD20200127
Limiting spectrum of sparse graphs
In this introductory talk, I will present a general limiting
theory for the spectrum of large networks. The models I will consider
are quite general, but they share a common feature : all of them are
studied in their very sparse regime where the number of connections has
the same order as the number of nodes (Erdös-Rényi with fixed mean
degree, regular graphs, uniform trees, uniform triangulations,
preferential attachments). The spectrum of such networks is notoriously