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 asmixing, orpseudo-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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Simplicial branching random walks;Journal of Applied and Computational Topology;2023-11-10
2. Bounded degree cosystolic expanders of every dimension;Journal of the American Mathematical Society;2023-07-21
3. Hypercontractivity on high dimensional expanders;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. High dimensional Hoffman bound and applications in extremal combinatorics;Algebraic Combinatorics;2022-01-04
5. Algebraic and combinatorial expansion in random simplicial complexes;Random Structures & Algorithms;2021-07-16