Eigenvalues and expansion of regular graphs
From MaRDI portal
Publication:4369891
DOI10.1145/210118.210136zbMATH Open0885.68117OpenAlexW2047342855MaRDI QIDQ4369891FDOQ4369891
Authors: Nabil Kahalé 
Publication date: 28 January 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/210118.210136
Recommendations
Cited In (21)
- Randomised broadcasting: memory vs. randomness
- Expansion in matrix-weighted graphs
- Explicit expanders of every degree and size
- Eigenvalues and expanders
- Tight estimates for eigenvalues of regular graphs
- High-girth near-Ramanujan graphs with localized eigenvectors
- A generalized Alon-Boppana bound and weak Ramanujan graphs
- Local majorities, coalitions and monopolies in graphs: A review
- Expansion of random graphs: new proofs, new results
- Fast algorithms for general spin systems on bipartite expanders
- Title not available (Why is that?)
- Basic Facts about Expander Graphs
- Symmetric unique neighbor expanders and good LDPC codes
- Slow emergence of cooperation for win-stay lose-shift on trees
- A sample of samplers: a computational perspective on sampling
- Randomness buys depth for approximate counting
- An introduction to randomness extractors
- Optimal explicit small-depth formulas for the coin problem
- Random walks on rotating expanders
- Expander graphs and their applications
- Deterministic tensor completion with hypergraph expanders
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)
