Higher Dimensional Discrete Cheeger Inequalities
Anna Gundert, May Szedl\'ak

TL;DR
This paper extends the Cheeger inequality to higher-dimensional simplicial complexes, providing two different proofs that establish spectral-expansion relationships beyond the well-understood graph case.
Contribution
It proves the Cheeger inequality for arbitrary simplicial complexes, generalizing previous results limited to complexes with complete skeletons, using two distinct proof techniques.
Findings
Established the Cheeger inequality for all finite simplicial complexes.
Provided two different proofs with unique methods and potential for further strengthening.
Extended spectral-expansion relationships from graphs to higher dimensions.
Abstract
For graphs there exists a strong connection between spectral and combinatorial expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the lower bound of which states that , where is the second smallest eigenvalue of the Laplacian of a graph and is the Cheeger constant measuring the edge expansion of . We are interested in generalizations of expansion properties to finite simplicial complexes of higher dimension (or uniform hypergraphs). Whereas higher dimensional Laplacians were introduced already in 1945 by Eckmann, the generalization of edge expansion to simplicial complexes is not straightforward. Recently, a topologically motivated notion analogous to edge expansion that is based on -cohomology was introduced by Gromov and independently by Linial, Meshulam and Wallach. It is known that for…
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
TopicsTopological and Geometric Data Analysis · Graph theory and applications · Advanced Graph Theory Research
