The spectrum of random k-lifts of large graphs (with possibly large k)

From MaRDI portal
Publication:547863

DOI10.4310/JOC.2010.V1.N3.A2zbMATH Open1244.05147arXiv0911.4741MaRDI QIDQ547863FDOQ547863


Authors: Roberto I. Oliveira Edit this on Wikidata


Publication date: 27 June 2011

Published in: Journal of Combinatorics (Search for Journal in Brave)

Abstract: We study random k-lifts of large, but otherwise arbitrary graphs G. We prove that, with high probability, all eigenvalues of the adjacency matrix of the lift that are not eigenvalues of G are of the order (D ln (kn))^{1/2}, where D is the maximum degree of G. Similarly, and also with high probability, the "new" eigenvalues of the Laplacian of the lift are all in an interval of length (ln (nk)/d)^{1/2} around 1, where d is the minimum degree of G. We also prove that, from the point of view of Spectral Graph Theory, there is very little difference between a random k_1k_2 ... k_r-lift of a graph and a random k_1-lift of a random k_2-lift of ... of a random k_r-lift of the same graph. The main proof tool is a concentration inequality for sums of random matrices that was recently introduced by the author.


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




Recommendations





Cited In (14)





This page was built for publication: The spectrum of random \(k\)-lifts of large graphs (with possibly large \(k)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547863)