The dual Cheeger-Buser inequality for graphons
Combinatorics
2025-02-24 v1
Abstract
We introduce the notion of bipartiteness ratio for graphons. We prove the dual Cheeger-Buser inequality for graphons, which relates the gap between and the top of the spectrum of the Laplacian of a graphon with its bipartiteness ratio. The dual Cheeger-Buser inequality was established by Trevisan and Bauer-Jost for graphs. Our result is an analog of that for graphons.
Cite
@article{arxiv.2502.15213,
title = {The dual Cheeger-Buser inequality for graphons},
author = {Mugdha Mahesh Pokharanakar},
journal= {arXiv preprint arXiv:2502.15213},
year = {2025}
}
Comments
Comments are welcome