Skip to main content

Eigenstripping, Spectral Decay, and Edge-Expansion on Posets

Publication ,  Conference
Gaitonde, J; Hopkins, M; Kaufman, T; Lovett, S; Zhang, R
Published in: Leibniz International Proceedings in Informatics Lipics
September 1, 2022

Fast mixing of random walks on hypergraphs (simplicial complexes) has recently led to myriad breakthroughs throughout theoretical computer science. Many important applications, however, (e.g. to LTCs, 2-2 games) rely on a more general class of underlying structures called posets, and crucially take advantage of non-simplicial structure. These works make it clear that the global expansion properties of posets depend strongly on their underlying architecture (e.g. simplicial, cubical, linear algebraic), but the overall phenomenon remains poorly understood. In this work, we quantify the advantage of different poset architectures in both a spectral and combinatorial sense, highlighting how regularity controls the spectral decay and edge-expansion of corresponding random walks. We show that the spectra of walks on expanding posets (Dikstein, Dinur, Filmus, Harsha APPROX-RANDOM 2018) concentrate in strips around a small number of approximate eigenvalues controlled by the regularity of the underlying poset. This gives a simple condition to identify poset architectures (e.g. the Grassmann) that exhibit strong (even exponential) decay of eigenvalues, versus architectures like hypergraphs whose eigenvalues decay linearly - a crucial distinction in applications to hardness of approximation and agreement testing such as the recent proof of the 2-2 Games Conjecture (Khot, Minzer, Safra FOCS 2018). We show these results lead to a tight characterization of edge-expansion on expanding posets in the ℓ2-regime (generalizing recent work of Bafna, Hopkins, Kaufman, and Lovett (SODA 2022)), and pay special attention to the case of the Grassmann where we show our results are tight for a natural set of sparsifications of the Grassmann graphs. We note for clarity that our results do not recover the characterization of expansion used in the proof of the 2-2 Games Conjecture which relies on ℓ rather than ℓ2-structure.

Duke Scholars

Published In

Leibniz International Proceedings in Informatics Lipics

DOI

ISSN

1868-8969

Publication Date

September 1, 2022

Volume

245

Related Subject Headings

  • 46 Information and computing sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Gaitonde, J., Hopkins, M., Kaufman, T., Lovett, S., & Zhang, R. (2022). Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. In Leibniz International Proceedings in Informatics Lipics (Vol. 245). https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.16
Gaitonde, J., M. Hopkins, T. Kaufman, S. Lovett, and R. Zhang. “Eigenstripping, Spectral Decay, and Edge-Expansion on Posets.” In Leibniz International Proceedings in Informatics Lipics, Vol. 245, 2022. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.16.
Gaitonde J, Hopkins M, Kaufman T, Lovett S, Zhang R. Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. In: Leibniz International Proceedings in Informatics Lipics. 2022.
Gaitonde, J., et al. “Eigenstripping, Spectral Decay, and Edge-Expansion on Posets.” Leibniz International Proceedings in Informatics Lipics, vol. 245, 2022. Scopus, doi:10.4230/LIPIcs.APPROX/RANDOM.2022.16.
Gaitonde J, Hopkins M, Kaufman T, Lovett S, Zhang R. Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. Leibniz International Proceedings in Informatics Lipics. 2022.

Published In

Leibniz International Proceedings in Informatics Lipics

DOI

ISSN

1868-8969

Publication Date

September 1, 2022

Volume

245

Related Subject Headings

  • 46 Information and computing sciences