The rank of diluted random graphs

Details The rank of diluted random graphs The rank of diluted random graphs

2009-07-24

arxiv.org/abs/0907.4244v4

Annals of Probability 2011, Vol. 39, No. 3, 1097-1121

Mathematics

Probability

Published in at http://dx.doi.org/10.1214/10-AOP567 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of

Scientific paper

10.1214/10-AOP567

We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs $(G_n)_{n\geq0}$ 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 $\phi_*$ 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 $\phi_*$ for the expectation of this atomic mass to be precisely the normalized limit of the dimension of the kernel of the adjacency matrices of $(G_n)_{n\geq 0}$. Our proofs borrow ideas from analysis of algorithms, functional analysis, random matrix theory and statistical physics.

Affiliated with

Also associated with

No associations

Rating

The rank of diluted random graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The rank of diluted random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The rank of diluted random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-309416