The spectrum of random k-lifts of large graphs (with possibly large k)
From MaRDI portal
(Redirected from Publication:547863)
The spectrum of random \(k\)-lifts of large graphs (with possibly large \(k)\)
The spectrum of random \(k\)-lifts of large graphs (with possibly large \(k)\)
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.
Recommendations
Cited in
(14)- T-product tensors. II: Tail bounds for sums of random T-product tensors
- On the expansion of group-based lifts
- On the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs
- Signatures, lifts, and eigenvalues of graphs
- A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
- Eigenvalues of random lifts and polynomials of random permutation matrices
- Spectra and eigenspaces of arbitrary lifts of graphs
- The spectra of multiplicative attribute graphs
- Word maps and spectra of random graph lifts
- Time-uniform Chernoff bounds via nonnegative supermartingales
- The spectral norm of random lifts of matrices
- On the expansion of group-based lifts
- Spectra of lifted Ramanujan graphs
- The expected norm of a sum of independent random matrices: an elementary approach
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)