A Cheeger Inequality for Small Set Expansion

04/15/2023
by   Akhil Jalan, et al.
0

The discrete Cheeger inequality, due to Alon and Milman (J. Comb. Theory Series B 1985), is an indispensable tool for converting the combinatorial condition of graph expansion to an algebraic condition on the eigenvalues of the graph adjacency matrix. We prove a generalization of Cheeger's inequality, giving an algebraic condition equivalent to small set expansion. This algebraic condition is the p-to-q hypercontractivity of the top eigenspace for the graph adjacency matrix. Our result generalizes a theorem of Barak et al (STOC 2012) to the low small set expansion regime, and has a dramatically simpler proof; this answers a question of Barak (2014).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/26/2022

On linear-algebraic notions of expansion

A fundamental fact about bounded-degree graph expanders is that three no...
research
03/11/2022

Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues

The classical Cheeger's inequality relates the edge conductance ϕ of a g...
research
02/18/2022

Sketching Distances in Monotone Graph Classes

We study the problems of adjacency sketching, small-distance sketching, ...
research
08/20/2023

Higher-Order Cheeger Inequality for Partitioning with Buffers

We prove a new generalization of the higher-order Cheeger inequality for...
research
05/02/2022

Eigenstripping, Spectral Decay, and Edge-Expansion on Posets

Fast mixing of random walks on hypergraphs has led to myriad breakthroug...
research
12/24/2019

An algorithm to evaluate the spectral expansion

Assume that X is a connected (q+1)-regular undirected graph of finite or...
research
01/19/2023

Combinatorial and Algebraic Properties of Nonnegative Matrices

We study the combinatorial and algebraic properties of Nonnegative Matri...

Please sign up or login with your details

Forgot password? Click here to reset