Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification

09/15/2022
by   Fernando Granha Jeronimo, et al.
0

We give an efficient algorithm that transforms any bounded degree expander graph into another that achieves almost optimal (namely, near-quadratic, d ≤ 1/λ^2+o(1)) trade-off between (any desired) spectral expansion λ and degree d. Furthermore, the algorithm is local: every vertex can compute its new neighbors as a subset of its original neighborhood of radius O(log(1/λ)). The optimal quadratic trade-off is known as the Ramanujan bound, so our construction gives almost Ramanujan expanders from arbitrary expanders. The locality of the transformation preserves structural properties of the original graph, and thus has many consequences. Applied to Cayley graphs, our transformation shows that any expanding finite group has almost Ramanujan expanding generators. Similarly, one can obtain almost optimal explicit constructions of quantum expanders, dimension expanders, monotone expanders, etc., from existing (suboptimal) constructions of such objects. Another consequence is a "derandomized" random walk on the original (suboptimal) expander with almost optimal convergence rate. Our transformation also applies when the degree is not bounded or the expansion is not constant. We obtain our results by a generalization of Ta-Shma's technique in his breakthrough paper [STOC 2017], used to obtain explicit almost optimal binary codes. Specifically, our spectral amplification extends Ta-Shma's analysis of bias amplification from scalars to matrices of arbitrary dimension in a very natural way. Curiously, while Ta-Shma's explicit bias amplification derandomizes a well-known probabilistic argument (underlying the Gilbert–Varshamov bound), there seems to be no known probabilistic (or other existential) way of achieving our explicit ("high-dimensional") spectral amplification.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2023

From Grassmannian to Simplicial High-Dimensional Expanders

In this paper, we present a new construction of simplicial complexes of ...
research
10/01/2022

Local and global expansion in random geometric graphs

Consider a random geometric 2-dimensional simplicial complex X sampled a...
research
06/13/2023

New Explicit Constant-Degree Lossless Expanders

We present a new explicit construction of onesided bipartite lossless ex...
research
04/25/2022

Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares

We construct an explicit family of 3-XOR instances hard for Ω(n)-levels ...
research
05/03/2021

Near-Optimal Cayley Expanders for Abelian Groups

We give an efficient deterministic algorithm that outputs an expanding g...
research
12/26/2022

On linear-algebraic notions of expansion

A fundamental fact about bounded-degree graph expanders is that three no...
research
12/02/2021

Explicit Abelian Lifts and Quantum LDPC Codes

For an abelian group H acting on the set [ℓ], an (H,ℓ)-lift of a graph G...

Please sign up or login with your details

Forgot password? Click here to reset