The rank of diluted random graphs

DOI10.1214/10-AOP567zbMath1298.05283arXiv0907.4244MaRDI QIDQ533748

Marc Lelarge, Justin Salez, Charles Bordenave

Publication date: 6 May 2011

Published in: The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

random matrices; random graphs; adjacency matrix; local weak convergence; Karp and Sipser algorithm

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

47A10: Spectrum, resolvent

15B52: Random matrices (algebraic aspects)

Related Items

Random Simplicial Complexes: Around the Phase Transition, A new approach to the orientation of random hypergraphs, The rank of sparse random matrices, Singularity of the \(k\)-core of a random graph, Existence of absolutely continuous spectrum for Galton-Watson random trees, Finding maximum matchings in random regular graphs in linear expected time, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Matchings on trees and the adjacency matrix: A determinantal viewpoint, Bernoulli random matrices, On the distribution of eigenvalues of increasing trees, On the phase transition in random simplicial complexes, Matchings on infinite graphs, Spectrum of non-Hermitian heavy tailed random matrices, Lifshitz tails on the Bethe lattice: A combinatorial approach, Spectrum of large random reversible Markov chains: heavy-tailed weights on the complete graph, The rank of random regular digraphs of constant degree, On quantum percolation in finite regular graphs, Mean quantum percolation, Emergence of extended states at zero in the spectrum of sparse random graphs, Recent progress in combinatorial random matrix theory, Atoms of the matching measure, Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group, Sparse expanders have negative curvature, Spectra of large diluted but bushy random graphs, Weighted enumeration of spanning subgraphs in locally tree-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matchings on infinite graphs
• Random symmetric matrices are almost surely nonsingular.
• Spectra of random linear combinations of matrices defined via representations and Coxeter generators of the symmetric group
• Extended states in the Anderson model on the Bethe lattice
• Recurrence of distributional limits of finite planar graphs
• Processes on unimodular random networks
• Stability of the absolutely continuous spectrum of random Schrödinger operators on tree graphs
• Resolvent of large random graphs
• Karp–Sipser on Random Graphs with a Fixed Degree Sequence
• The rank of random graphs
• On the kernel of tree incidence matrices
• Eigenvalue distribution of large weighted random graphs