Mixing in High-Dimensional Expanders
From MaRDI portal
Publication:5366971
DOI10.1017/S0963548317000116zbMath1371.05329arXiv1310.6477MaRDI QIDQ5366971
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6477
Hodge theory in global analysis (58A14) Simplicial sets and complexes in algebraic topology (55U10) Spectral theory; eigenvalue problems on manifolds (58C40) Combinatorial aspects of simplicial complexes (05E45)
Related Items
Networks beyond pairwise interactions: structure and dynamics, Inverse expander mixing for hypergraphs, Spectrum and combinatorics of two-dimensional Ramanujan complexes, Algebraic and combinatorial expansion in random simplicial complexes, Bounded degree cosystolic expanders of every dimension, Local spectral expansion approach to high dimensional expanders. I: Descent of spectral gaps, Local spectral expansion approach to high dimensional expanders. II: Mixing and geometrical overlapping, High dimensional Hoffman bound and applications in extremal combinatorics, Ramanujan complexes and high dimensional expanders, Deterministic Tensor Completion with Hypergraph Expanders, Toward a spectral theory of cellular sheaves, Hypergraph expanders from Cayley graphs, Random Steiner systems and bounded degree coboundary expanders of every dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Inverse expander mixing for hypergraphs
- Expansion of random graphs: new proofs, new results
- On eigenvalues of random complexes
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- On the chromatic number of a simplicial complex
- On Gromov's method of selecting heavily covered points
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Ramanujan complexes of type \(\widetilde A_d\)
- Homological connectivity of random 2-complexes
- Lifts, discrepancy and nearly optimal spectral gap
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Expanding graphs contain all small trees
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Eigenvalues and expanders
- A Tverberg-type result on multicolored simplices
- Computing Betti numbers via combinatorial Laplacians
- Ramanujan geometries of type \(\tilde A_{n}\)
- Ramanujan hypergraphs
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Isoperimetric inequalities in simplicial complexes
- Spectrum and combinatorics of two-dimensional Ramanujan complexes
- Spectra of combinatorial Laplace operators on simplicial complexes
- p-adic curvature and the cohomology of discrete subgroups of p-adic groups
- Eigenvalues and homology of flag complexes and vector representations of graphs
- Explicit construction of a Ramanujan \((n_1,n_2,\dots,n_{d-1})\)-regular hypergraph
- Harmonic functions and boundary value problems on a chain complex
- Random walks on simplicial complexes and harmonics
- Simplicial complexes: Spectrum, homology and random walks
- Spectral Sparsification of Graphs
- Overlap properties of geometric expanders
- Explicit Concentrators from Generalized N-Gons
- A proof of Alon’s second eigenvalue conjecture and related problems
- Simplicial matrix-tree theorems
- Finite-Difference Approach to the Hodge Theory of Harmonic Forms
- Higher Dimensional Cheeger Inequalities
- Combinatorial Laplacians of matroid complexes
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
