Resolvent of Large Random Graphs

Simple item page
dc.creatorBordenave, Charles
dc.creatorLelarge, Marc
dc.date2007-12-31
dc.date2009-05-05
dc.date.accessioned2026-07-07T13:11:05Z
dc.date.available2026-07-07T13:11:05Z
dc.descriptionWe analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results 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 preferential attachment graphs. We sketch examples of application for weighted graphs, bipartite graphs and the uniform spanning tree of n vertices.
dc.description21 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0801.0155
dc.identifierhttp://arxiv.org/abs/0801.0155
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229181
dc.subjectProbability
dc.subjectMathematical Physics
dc.subject05C80, 15A52 (Primary); 47A10 (Secondary)
dc.titleResolvent of Large Random Graphs
dc.typetext

Files

Collections

arXiv