Scholarlink

<p>We introduce the notion of bipartiteness ratio for graphons. We prove the dual Cheeger–Buser inequality for graphons, which relates the gap between 2 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. We also establish the dual Cheeger–Buser inequality for graphings.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The dual Cheeger–Buser inequality for graphons and graphings

  • 期刊论文

  • 发表日期：

    2026年7月8日

查看全文
  • Mugdha Mahesh Pokharanakar

摘要

We introduce the notion of bipartiteness ratio for graphons. We prove the dual Cheeger–Buser inequality for graphons, which relates the gap between 2 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. We also establish the dual Cheeger–Buser inequality for graphings.