A Cheeger Inequality for Size-Specific Conductance

03/20/2023
by   Yufan Huang, et al.
0

The μ-conductance measure proposed by Lovasz and Simonovits is a size-specific conductance score that identifies the set with smallest conductance while disregarding those sets with volume smaller than a μ fraction of the whole graph. Using μ-conductance enables us to study in new ways. In this manuscript we propose a modified spectral cut that is a natural relaxation of the integer program of μ-conductance and show the optimum of this program has a two-sided Cheeger inequality with μ-conductance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2018

A Schur Complement Cheeger Inequality

Cheeger's inequality shows that any undirected graph G with minimum nonz...
research
11/27/2018

Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem

We study spectral approaches for the MAX-2-LIN(k) problem, in which we a...
research
09/04/2017

MIP Formulations for the Steiner Forest Problem

The Steiner Forest problem is among the fundamental network design probl...
research
10/24/2022

Edge-Cuts and Rooted Spanning Trees

We give a closed form formula to determine the size of a k-respecting cu...
research
03/12/2020

On the Complexity of λ_∞ , Vertex Expansion, and Spread Constant of Trees

Bobkov, Houdré, and the last author introduced a Poincaré-type functiona...
research
06/22/2021

Mixing dynamics and group imbalance lead to degree inequality in face-to-face interaction

Uncovering how inequality emerges from human interaction is imperative f...
research
09/16/2018

When Lift-and-Project Cuts are Different

In this paper, we present a method to determine if a lift-and-project cu...

Please sign up or login with your details

Forgot password? Click here to reset