Abstract:The $\mu$-conductance measure proposed by Lovász and Simonovits is a size-specific conductance score that identifies the set with smallest conductance while disregarding those sets with volume smaller than a $\mu$ fraction of the whole graph. Using $\mu$-conductance enables us to study the network structures in new ways. In this manuscript we study a modified spectral cut for $\mu$-conductance that is a natural relaxation of the integer program of $\mu$-conductance and show that the optimum of this program has a two-sided Cheeger inequality with $\mu$-conductance.
From: Yufan Huang [view email]
[v1]
Mon, 20 Mar 2023 21:00:15 UTC (11 KB)
[v2]
Fri, 30 Jan 2026 04:48:22 UTC (47 KB)
[v3]
Mon, 13 Jul 2026 03:49:53 UTC (46 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。