Resolvent of Large Random Graphs release_5bahp35jhvftpgqxqox32z5dy4

by Charles Bordenave, Marc Lelarge

Released as a article .

2007  

Abstract

We 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.
In text/plain format

Archived Files and Locations

application/pdf  269.9 kB
file_pxuattc27nhtrp2ydbgeiqwmza
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2007-12-31
Version   v1
Language   en ?
arXiv  0801.0155v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 7704aa5c-3d6b-47d5-a8d2-cee5deb2c13b
API URL: JSON