Abstract
We establish a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to as mixing, or pseudo-randomness). Recently, an analogue of this lemma was proved for simplicial complexes of arbitrary dimension, provided that the skeleton of the complex is complete. More precisely, it was shown that a concentrated spectrum of the simplicial Hodge Laplacian implies a similar type of pseudo-randomness as in graphs. In this paper we remove the assumption of a complete skeleton, showing that simultaneous concentration of the Laplace spectra in all dimensions implies pseudo-randomness in any complex. We discuss various applications and present some open questions.
| Original language | English |
|---|---|
| Pages (from-to) | 746-761 |
| Number of pages | 16 |
| Journal | Combinatorics Probability and Computing |
| Volume | 26 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 Sep 2017 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2017 Cambridge University Press.
Fingerprint
Dive into the research topics of 'Mixing in High-Dimensional Expanders'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver