A combinatorial approach to nonlinear spectral gaps

TL;DR

This paper introduces a combinatorial method to establish polynomial bounds on nonlinear spectral gaps for regular graphs in normed spaces with unconditional bases, advancing understanding of Poincaré inequalities and embeddings.

Contribution

It develops a new combinatorial framework based on long-range expansion to obtain optimal polynomial bounds on Poincaré constants for spaces with unconditional bases and finite cotype.

Findings

Polynomial dependence of Poincaré constants on cotype q

High probability of long-range expansion in random regular graphs

Lower bounds on cotype for low-distortion embeddings of random graphs

Abstract

A seminal open question of Pisier and Mendel--Naor asks whether every degree-regular graph which satisfies the classical discrete Poincar\'e inequality for scalar functions, also satisfies an analogous inequality for functions taking values in \textit{any} normed space with non-trivial cotype. Motivated by applications, it is also greatly important to quantify the dependence of the corresponding optimal Poincar\'e constant on the cotype $q$. Works of Odell--Schlumprecht (1994), Ozawa (2004), and Naor (2014) make substantial progress on the former question by providing a positive answer for normed spaces which also have an unconditional basis, in addition to finite cotype. However, little is known in the way of quantitative estimates: the mentioned results imply a bound on the Poincar\'e constant depending super-exponentially on $q$. We introduce a novel combinatorial framework for proving quantitative nonlinear spectral gap estimates. The centerpiece is a property of regular graphs that we call \emph{long range expansion}, which holds with high probability for random regular graphs. Our main result is that any regular graph with the long-range expansion property satisfies a discrete Poincar\'{e} inequality for any normed space with an unconditional basis and cotype $q$, with a Poincar\'{e} constant that depends \emph{polynomially} on $q$, which is optimal. As an application, any normed space with an unconditional basis which admits a low distortion embedding of an $n$-vertex random regular graph, must have cotype at least polylogarithmic in $n$. This extends a celebrated lower-bound of Matou\v{s}ek for low distortion embeddings of random graphs into $\ell_q$ spaces.