Random graph coverings. I: General theory and graph connectivity

From MaRDI portal
Revision as of 09:53, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:700369

DOI10.1007/S004930200000zbMath0996.05105OpenAlexW1974893148MaRDI QIDQ700369

Alon Amit, Nathan Linial

Publication date: 20 October 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930200000






Related Items (26)

Tight products and graph expansionRamanujan coverings of graphsFind Your Place: Simple Distributed Algorithms for Community DetectionCUTOFF AT THE ENTROPIC TIME FOR RANDOM WALKS ON COVERED EXPANDER GRAPHSSpectrum of random d‐regular graphs up to the edgeStatistics of finite degree covers of torus knot complementsExpander graphs and their applicationsRandom lifts of graphs are highly connectedSignatures, Lifts, and Eigenvalues of GraphsRelative expanders or weakly relatively Ramanujan graphs.Expansion of random graphs: new proofs, new resultsCops and robber on some families of oriented graphsUniversality and sharp matrix concentration inequalitiesHamilton cycles in random lifts of graphsOn the Number of Perfect Matchings in Random Lifts\(\delta\)-connectivity in random lifts of graphsHamilton cycles in random lifts of graphsSpectra of lifted Ramanujan graphsEmpirical spectral measures of quantum graphs in the Benjamini-Schramm limit\(L^p\) norms and support of eigenfunctions on graphsThe spectral norm of random lifts of matricesThe chromatic number of random lifts ofMeasure preserving words are primitiveSheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren DicksEigenvalues of random lifts and polynomials of random permutation matricesOn cylindrical graph construction and its applications







This page was built for publication: Random graph coverings. I: General theory and graph connectivity