Eigenvalues and expansion of regular graphs
From MaRDI portal
Recommendations
Cited in
(25)- Eigenvalues and expanders
- Local majorities, coalitions and monopolies in graphs: A review
- Tight estimates for eigenvalues of regular graphs
- High-girth near-Ramanujan graphs with localized eigenvectors
- Explicit expanders of every degree and size
- Slow emergence of cooperation for win-stay lose-shift on trees
- An introduction to randomness extractors
- A sample of samplers: a computational perspective on sampling
- Basic Facts about Expander Graphs
- Symmetric unique neighbor expanders and good LDPC codes
- Expander graphs and their applications
- Randomised broadcasting: memory vs. randomness
- scientific article; zbMATH DE number 1256665 (Why is no real title available?)
- scientific article; zbMATH DE number 475377 (Why is no real title available?)
- Randomness buys depth for approximate counting
- Expansion of random graphs: new proofs, new results
- Fast algorithms for general spin systems on bipartite expanders
- Deterministic tensor completion with hypergraph expanders
- Optimal explicit small-depth formulas for the coin problem
- Random walks on rotating expanders
- Spectrum preserving short cycle removal on regular graphs
- High-girth near-Ramanujan graphs with lossy vertex expansion
- A generalized Alon-Boppana bound and weak Ramanujan graphs
- Limit vectors of the top k eigenvalues of d-regular graphs
- Expansion in matrix-weighted graphs
This page was built for publication: Eigenvalues and expansion of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369891)
