On linear-algebraic notions of expansion

by   Yinan Li, et al.

A fundamental fact about bounded-degree graph expanders is that three notions of expansion – vertex expansion, edge expansion, and spectral expansion – are all equivalent. In this paper, we study to what extent such a statement is true for linear-algebraic notions of expansion. There are two well-studied notions of linear-algebraic expansion, namely dimension expansion (defined in analogy to graph vertex expansion) and quantum expansion (defined in analogy to graph spectral expansion). Lubotzky and Zelmanov proved that the latter implies the former. We prove that the converse is false: there are dimension expanders which are not quantum expanders. Moreover, this asymmetry is explained by the fact that there are two distinct linear-algebraic analogues of graph edge expansion. The first of these is quantum edge expansion, which was introduced by Hastings, and which he proved to be equivalent to quantum expansion. We introduce a new notion, termed dimension edge expansion, which we prove is equivalent to dimension expansion and which is implied by quantum edge expansion. Thus, the separation above is implied by a finer one: dimension edge expansion is strictly weaker than quantum edge expansion. This new notion also leads to a new, more modular proof of the Lubotzky–Zelmanov result that quantum expanders are dimension expanders.


page 1

page 2

page 3

page 4


Planted Models for k-way Edge and Vertex Expansion

Graph partitioning problems are a central topic of study in algorithms a...

A Cheeger Inequality for Small Set Expansion

The discrete Cheeger inequality, due to Alon and Milman (J. Comb. Theory...

Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma

Given a graph and two integers k and ℓ, Partial Vertex Cover asks for a ...

Combinatorial and Algebraic Properties of Nonnegative Matrices

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

High-girth near-Ramanujan graphs with lossy vertex expansion

Kahale proved that linear sized sets in d-regular Ramanujan graphs have ...

Wireless Expanders

This paper introduces an extended notion of expansion suitable for radio...

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification

We give an efficient algorithm that transforms any bounded degree expand...

Please sign up or login with your details

Forgot password? Click here to reset