Cheeger inequalities on simplicial complexes
J\"urgen Jost, Dong Zhang

TL;DR
This paper extends Cheeger inequalities to higher-dimensional simplicial complexes by identifying appropriate Cheeger constants and developing a theory for p-Laplacians, bridging topology, graph theory, and spectral analysis.
Contribution
It introduces the first Cheeger-type inequalities for simplicial complexes and develops a general framework for p-Laplacians in this context.
Findings
Identified the correct Cheeger constant for simplicial complexes.
Established Cheeger inequalities for higher-order Laplacians.
Connected simplicial topology with spectral graph theory.
Abstract
Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander theory. The natural problem to extend such inequalities to simplicial complexes and their higher order Eckmann Laplacians has been open for a long time. Before proving any inequality, however, one needs to identify the right Cheeger-type constant for which such an inequality can hold. Here, we solve this problem. Our solution involves and combines constructions from simplicial topology, signed graphs, Gromov filling radii and an interpolation between the standard 2-Laplacians and the analytically more difficult 1-Laplacians, for which, however, the inequalities become equalities. It is then natural to develop a general theory for -Laplacians on…
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
TopicsGraph theory and applications · Topological and Geometric Data Analysis · Synthesis and Properties of Aromatic Compounds
