Almost-Ramanujan expanders from arbitrary expanders via operator amplification
From MaRDI portal
Cites work
- A Chernoff Bound for Random Walks on Expander Graphs
- A combinatorial construction of almost-Ramanujan graphs using the zig-zag product
- A proof of alon's second eigenvalue conjecture
- An introduction to matrix concentration inequalities
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Classical and quantum tensor product expanders
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Dimension expanders
- Dimension Expanders via Rank Condensers
- Discrete groups, expanding graphs and invariant measures. With an appendix by Jonathan D. Rogawski
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Expander graphs and their applications
- Expander graphs in pure and applied mathematics
- Expanders in group algebras
- Expansion in SL₂( R) and monotone expanders
- Explicit estimate on primes between consecutive cubes
- Explicit expanders of every degree and size
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Explicit near-Ramanujan graphs of every degree
- Explicit, almost optimal, epsilon-balanced codes
- Finite simple groups of Lie type as expanders.
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 1559521 (Why is no real title available?)
- scientific article; zbMATH DE number 1827712 (Why is no real title available?)
- scientific article; zbMATH DE number 7829320 (Why is no real title available?)
- scientific article; zbMATH DE number 7799602 (Why is no real title available?)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Iterative construction of Cayley expander graphs
- Lifts, discrepancy and nearly optimal spectral gap
- Local tests of global entanglement and a counterexample to the generalized area law
- Mathematics and computation. A theory revolutionizing technology and science
- Monotone expanders: constructions and applications
- On property (T) for \(\Aut(F_n)\) and \(\mathrm{SL}_n(\mathbb{Z})\)
- On the diameter of Cayley graphs of the symmetric group
- On the expansion of group-based lifts
- On the second eigenvalue of a graph
- Quantum expanders from any classical Cayley graph expander
- Ramanujan graphs
- Random Cayley graphs and expanders
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Sets for Nonabelian Groups
- Small-diameter Cayley graphs for finite simple groups
- Strong converse for identification via quantum channels
- Symmetric groups and expander graphs.
- The product replacement algorithm and Kazhdan's property (T)
- Towards dimension expanders over finite fields
- Undirected ST-connectivity in log-space
- Unique decoding of explicit -balanced codes near the Gilbert-Varshamov bound
This page was built for publication: Almost-Ramanujan expanders from arbitrary expanders via operator amplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911555)
