Explicit expanders of every degree and size
From MaRDI portal
Publication:2236654
DOI10.1007/s00493-020-4429-xzbMath1488.05288arXiv2003.11673MaRDI QIDQ2236654
Publication date: 25 October 2021
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.11673
05C80: Random graphs (graph-theoretic aspects)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C48: Expander graphs
Related Items
On Constructing Expanders for Any Number of Vertices, Efficient and Reliable Overlay Networks for Decentralized Federated Learning, Paradigms for Unconditional Pseudorandom Generators, Cycle lengths modulo \(k\) in expanders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Eigenvalues and expanders
- On the second eigenvalue of a graph
- Some geometric aspects of graphs and their eigenfunctions
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- The Difference Between Consecutive Primes, II
- A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
- A new proof of Friedman's second eigenvalue theorem and its extension to random lifts
- Expander graphs and their applications
- A proof of Alon’s second eigenvalue conjecture and related problems
- Expander graphs and gaps between primes
- Eigenvalues and expansion of regular graphs
- Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
