Metraipolis › archive › dc_02e2d35d1bbe
A Cheeger Inequality for Hypergraphs and Its Applications — arXiv:2609.16286
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.16286
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T21:59:12.561Z
- SHA-256 of the archived text
25b1be90878d0f6d9b372f426eb2eae472bbdfa02411ded3ca4adf39c4479d6d- Stable URL of this page
https://metraipolis.com/documento/dc_02e2d35d1bbe
How to cite
A Cheeger Inequality for Hypergraphs and Its Applications — arXiv:2609.16286 — arXiv (en), https://arxiv.org/abs/2609.16286 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_02e2d35d1bbe (Metraipolis archive dc_02e2d35d1bbe, sha256 25b1be90878d0f6d9b372f426eb2eae472bbdfa02411ded3ca4adf39c4479d6d)
BibTeX
@misc{dc02e2d35d1bbe,
title = {A Cheeger Inequality for Hypergraphs and Its Applications — arXiv:2609.16286},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.16286},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_02e2d35d1bbe; sha256 25b1be90878d0f6d9b372f426eb2eae472bbdfa02411ded3ca4adf39c4479d6d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.16286. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Hypergraphs provide a natural framework for modeling higher-order relationships, but the development of spectral techniques with provable guarantees for general non-uniform hypergraphs remains challenging. Building on Banerjee's normalized adjacency matrix and Spiro's averaging-based diffusion framework, we develop a spectral framework for non-uniform hypergraphs and establish Cheeger's inequality for their conductance. A fundamental result in the spectral theory of hypergraphs asserts that, for every non-covering hypergraph, the second-smallest eigenvalue of its normalized Laplacian is at most one. This spectral characterization yields an improved Cheeger's inequality for non-covering hypergraphs, and we show that the resulting inequality is tight on both sides using cycle and cube hypergraphs. Our framework further yields higher-order Cheeger inequalities and provides theoretical guarantees for Fiedler's spectral partitioning algorithm, all in the setting of hypergraphs. Finally and most notably, we construct a new family of optimal hypergraph expanders that is tight for the Alon--Boppana bound. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-16 in cs.DS). Categorie arXiv: Combinatorics (math.CO) ; Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2609.16286 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T21:46:54.587Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).