Random graph coverings. I: General theory and graph connectivity
From MaRDI portal
Publication:700369
Recommendations
Cited in
(30)- Eigenvalues of random lifts and polynomials of random permutation matrices
- Universality and sharp matrix concentration inequalities
- On Cover Graphs and Dependent Arcs in Acyclic Orientations
- Signatures, lifts, and eigenvalues of graphs
- Measure preserving words are primitive
- Random graphs and covering graphs of posets
- Random lifts of graphs are highly connected
- Tight products and graph expansion
- Relative expanders or weakly relatively Ramanujan graphs.
- Spectrum of random d‐regular graphs up to the edge
- Hamilton cycles in random lifts of graphs
- Hamilton cycles in random lifts of graphs
- Expansion of random graphs: new proofs, new results
- Empirical spectral measures of quantum graphs in the Benjamini-Schramm limit
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Ramanujan coverings of graphs
- On cylindrical graph construction and its applications
- Expander graphs and their applications
- Minimum vertex cover in generalized random graphs with power law degree distribution
- On the number of perfect matchings in random lifts
- The spectral norm of random lifts of matrices
- \(\delta\)-connectivity in random lifts of graphs
- Average covering number for some graphs
- \(L^p\) norms and support of eigenfunctions on graphs
- Cops and robber on some families of oriented graphs
- The chromatic number of random lifts of \(K_5\setminus e\)
- Spectra of lifted Ramanujan graphs
- Cutoff at the entropic time for random walks on covered expander graphs
- Statistics of finite degree covers of torus knot complements
- Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks
This page was built for publication: Random graph coverings. I: General theory and graph connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700369)
