English

Towards a Calculus for Non-Linear Spectral Gaps [Extended Abstract]

Metric Geometry 2010-03-02 v1 Combinatorics Functional Analysis

Abstract

Given a finite regular graph G=(V,E) and a metric space (X,d_X), let gamma+(G,X)denotethesmallestconstantgamma_+(G,X) denote the smallest constant \gamma_+>0suchthatforallf,g:VXwehave:1V2x,yVdX(f(x),g(y))2γ+ExyEdX(f(x),g(y))2.InthespecialcaseX=Rthisquantitycoincideswiththereciprocaloftheabsolutespectralgapof such that for all f,g:V\to X we have: \frac{1}{|V|^2}\sum_{x,y\in V} d_X(f(x),g(y))^2\le \frac{\gamma_+}{|E|} \sum_{xy\in E} d_X(f(x),g(y))^2. In the special case X=R this quantity coincides with the reciprocal of the absolute spectral gap of G$, but for other geometries the parameter \gamma_+(G,X), which we still think of as measuring the non-linear spectral gap of G with respect to X (even though there is no actual spectrum present here), can behave very differently. Non-linear spectral gaps arise often in the theory of metric embeddings, and in the present paper we systematically study the theory of non-linear spectral gaps, partially in order to obtain a combinatorial construction of super-expander -- a family of bounded-degree graphs G_i=(V_i,E_i), with \lim_{i\to \infty} |V_i|=\infty, which do not admit a coarse embedding into any uniformly convex normed space. In addition, the bi-Lipschitz distortion of G_i in any uniformly convex Banach space is \Omega(\log |V_i|), which is the worst possible behavior due to Bourgain's embedding theorem. Such remarkable graph families were previously known to exist due to a tour de force algebraic construction of Lafforgue. Our construction is different and combinatorial, relying on the zigzag product of Reingold-Vadhan-Wigderson.

Keywords

Cite

@article{arxiv.0910.2041,
  title  = {Towards a Calculus for Non-Linear Spectral Gaps [Extended Abstract]},
  author = {Manor Mendel and Assaf Naor},
  journal= {arXiv preprint arXiv:0910.2041},
  year   = {2010}
}

Comments

32 pages. Extended abstract. To be published (in abridged form) in the proceedings of the ACM-SIAM Symposium on Discrete Algorithms 2010 (SODA '10)

R2 v1 2026-06-21T13:57:00.388Z