Nowhere to go but high: a perspective on high-dimensional expanders
DOI10.4171/icm2022/185arXiv2304.10106OpenAlexW4389774805MaRDI QIDQ6198648
Publication date: 20 March 2024
Published in: International Congress of Mathematicians (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.10106
Markov chainsrandom walksmatroidsquantum codeslocally testable codeslocal to globalhigh dimensional expanders
Combinatorics in computer science (68R05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Theory of error-correcting codes and error-detecting codes (94B99) Combinatorial aspects of simplicial complexes (05E45) Random walks on graphs (05C81) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Expander graphs (05C48)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isoperimetric inequalities for Ramanujan complexes and topological expanders
- Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\).
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- Homological connectivity of random 2-complexes
- Random generation of combinatorial structures from a uniform distribution
- Local spectral expansion approach to high dimensional expanders. I: Descent of spectral gaps
- Fault-tolerant quantum computation by anyons
- p-adic curvature and the cohomology of discrete subgroups of p-adic groups
- High dimensional expanders and property testing
- On Expansion and Topological Overlap
- On Cheeger-type inequalities for weighted graphs
- Expander graphs and their applications
- High Dimensional Random Walks and Colorful Expansion
- Balanced Product Quantum Codes
- Improved analysis of higher order random walks and applications
- Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
- Bounded degree cosystolic expanders of every dimension
- New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√ n log k n ) distance
This page was built for publication: Nowhere to go but high: a perspective on high-dimensional expanders
