Resolvent of large random graphs

DOI10.1002/rsa.20313zbMath1209.05222arXiv0801.0155MaRDI QIDQ3055896

Charles Bordenave, Marc Lelarge

Publication date: 10 November 2010

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.0155

zbMATH Keywords

random graphs; spectral measure; local convergence; Galton-Watson tree

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

Related Items

Matchings on infinite graphs, The rank of diluted random graphs, Lifshitz tails on the Bethe lattice: A combinatorial approach, Sparse regular random graphs: spectral density and eigenvectors, Spectra of large random trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectrum of large random reversible Markov chains: heavy-tailed weights on the complete graph
• Limits of dense graph sequences
• On limits of finite graphs
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Spectrum estimation for large dimensional covariance matrices using random matrix theory
• Walk generating functions and spectral measures of infinite graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The expected eigenvalue distribution of a large regular graph
• The spectrum of an infinite graph
• Recurrence of distributional limits of finite planar graphs
• The semicircle law for semiregular bipartite graphs
• Processes on unimodular random networks
• Symmetric Random Walks on Groups
• A Survey on Spectra of infinite Graphs
• Sparse random matrices: the eigenvalue spectrum revisited
• A critical point for random graphs with a given degree sequence
• Eigenvalue distribution of large weighted random graphs
• Random incidence matrices: moments of the spectral density