Higher-order Cheeger inequalities for graphons
Mugdha Mahesh Pokharanakar
TL;DR
This paper extends higher-order Cheeger inequalities from finite graphs to the more general setting of graphons, providing a theoretical advancement in understanding graph limits.
Contribution
The authors establish higher-order Cheeger inequalities for graphons, generalizing known results from finite graphs to the graphon framework.
Findings
Proved higher-order Cheeger inequalities for graphons.
Extended graph-theoretic spectral bounds to graph limits.
Provided a foundation for analyzing large-scale graph structures.
Abstract
The higher-order Cheeger inequalities were established for graphs by Lee, Oveis Gharan and Trevisan. We prove analogous inequalities for graphons in this article.
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 · Limits and Structures in Graph Theory · Advanced Graph Theory Research