Annals of Probability
- Ann. Probab.
- Volume 39, Number 3 (2011), 1097-1121.
The rank of diluted random graphs
We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs (Gn)n≥0 converging locally to a Galton–Watson tree T (GWT), we provide an explicit formula for the asymptotic multiplicity of the eigenvalue 0 in terms of the degree generating function φ∗ of T. In the first part, we show that the adjacency operator associated with T is always self-adjoint; we analyze the associated spectral measure at the root and characterize the distribution of its atomic mass at 0. In the second part, we establish a sufficient condition on φ∗ for the expectation of this atomic mass to be precisely the normalized limit of the dimension of the kernel of the adjacency matrices of (Gn)n≥0. Our proofs borrow ideas from analysis of algorithms, functional analysis, random matrix theory and statistical physics.
Ann. Probab., Volume 39, Number 3 (2011), 1097-1121.
First available in Project Euclid: 16 March 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Bordenave, Charles; Lelarge, Marc; Salez, Justin. The rank of diluted random graphs. Ann. Probab. 39 (2011), no. 3, 1097--1121. doi:10.1214/10-AOP567. https://projecteuclid.org/euclid.aop/1300281733