Spectrum of large random graphs

We will analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. These results will be applied to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such graphs. We illustrate our results on the uniform regular graphs, Erdos-Renyi graphs and graphs with prescribed degree distribution. We will sketch examples of application for weighted graphs, bipartite graphs and the uniform spanning tree of n vertices. If time allows, we will discuss related open problems. This is a joint work with Marc Lelarge (INRIA & Ecole Normale Supérieure).