The Cheeger Inequality and Coboundary Expansion: Beyond Constant Coefficients
Uriya A. First, Tali Kaufman

TL;DR
This paper extends Cheeger inequalities to graphs with sheaf coefficients, revealing new insights into coboundary expansion, especially on spherical buildings, and introduces a new expander mixing lemma for r-partite graphs.
Contribution
It generalizes Cheeger inequalities to sheaves on graphs, provides bounds on coboundary expansion for sheaves on spherical buildings, and introduces a new expander mixing lemma for r-partite graphs.
Findings
Graphs are good spectral expanders iff they have good coboundary expansion relative to any constant sheaf.
Sheaves close to constant on an expander graph are also good coboundary expanders.
Explicit bounds on coboundary expansion for sheaves on spherical buildings as the thickness grows.
Abstract
The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, . In this paper, we study Cheeger-type inequalities for graphs endowed with a generalized coefficient group, called a sheaf; this is motivated by applications to cosystolic expansion and locally testable codes. We prove that a graph is a good spectral expander if and only if it has good coboundary expansion relative to any (resp. some) constant sheaf, or equivalently, relative to any `ordinary' coefficient group. We moreover show that sheaves that are close to being constant in a well-defined sense are also good coboundary expanders, provided that their underlying graph is an expander, thus giving the first example of good coboundary expansion in non-cosntant sheaves on sparse graphs. By…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Limits and Structures in Graph Theory
