2017
DOI: 10.1017/s0963548317000116
|View full text |Cite
|
Sign up to set email alerts
|

Mixing in High-Dimensional Expanders

Abstract: We prove 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 quasi-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 i… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
26
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 31 publications
(27 citation statements)
references
References 46 publications
1
26
0
Order By: Relevance
“…The error term in that work was of the form |U 0 ||U n ||U 1 |...|U n−1 |. Also, a criterion for mixing for general (non-random) complexes based on the spectra of all high dimensional Laplacians was proven by Parzanchevski [Par17] and the error term in that result was max i |U i |. Our results improve the error terms in both works.…”
Section: Introductionsupporting
confidence: 59%
“…The error term in that work was of the form |U 0 ||U n ||U 1 |...|U n−1 |. Also, a criterion for mixing for general (non-random) complexes based on the spectra of all high dimensional Laplacians was proven by Parzanchevski [Par17] and the error term in that result was max i |U i |. Our results improve the error terms in both works.…”
Section: Introductionsupporting
confidence: 59%
“…A general result of this type was proven by Parzanchevski [25], saying that the desired pseudorandomness condition holds under essentially the hypothesis on the spectra of all the adjacency matrices that we proved in Theorem 3.9. However, Parzanchevski's result only applies when |λ2| λ1 < ǫ 0 (r) where ǫ 0 (r) is a small constant depending on the uniformity, while we have only proved that |λ2| λ1 < 1 − c(r)ǫ where ǫ is the expansion parameter of the original Cayley graph and c(r) is a very small constant depending on the uniformity.…”
Section: A Discrepancy Resultsmentioning
confidence: 63%
“…When ǫ is sufficiently close to 1 in terms of r, an argument in [25,26] allows us to deduce that H r,t,S is a geometric expander. The idea is simple.…”
Section: The Constructionmentioning
confidence: 99%
“…In [Lub14] two main approaches are suggested: The first is through the F 2 -coboundary expansion of X originated in [Gro10], [LM06] and [MW09] . The second is through studying the spectral gap of the (n − 1)-Laplacian of X (where n is the dimension of X) or the spectral gaps of all 0, .., (n − 1)-Laplacians of X (see [Par17], [PRT16]). One of the difficulties with both approaches are that both the F 2 -coboundary expansion and the spectral gap of the (n − 1)-Laplacian are usually hard to calculate or even bound in examples.…”
Section: Introductionmentioning
confidence: 99%