arXiv · 2509.25489
Metric Poincar\'e inequalities for graphs
Abstract
This article obtains purely metric counterparts of cornerstone results in the theory of embedding graphs into normed spaces. Our first main result is a metric analogue of Matou\v{s}ek's extrapolation relating the Poincar\'e constants $\gamma(G,\varrho^p)$ and $\gamma(G,\varrho^q)$ for any exponents $0 < p,q < \infty$, any bounded-degree expander graph $G$, and any target metric space $\mathcal{M}=(M,\varrho)$. Our second main result provides a sharp estimate of the Poincar\'e constant $\gamma(G,\varrho)$ in terms of the cardinalities of the vertex set of $G$ and the metric space $\mathcal{M}=(M,\varrho)$, in the setting of \textit{random} graphs. This yields optimal estimates on the minimum cardinality of (bi-Lipschitz) universal metric spaces for graphs, finally establishing a nonlinear analogue of Matou\v{s}ek's celebrated "incompressibility" theorem (1996). Further, we obtain estimates on the nonlinear spectral gap of metric snowflakes and sharp lower bounds on the distortion of random regular graphs into arbitrary metric spaces. Our proofs develop new nonlinear techniques, including random compression methods and a novel structural dichotomy for metric embeddings.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dylan J. Altschuler, Pandelis Dodos, Konstantin Tikhomirov, Konstantinos Tyros. 2025-09-29. Metric Poincar\'e inequalities for graphs. https://arxiv.org/abs/2509.25489
Cite the original work for its findings. Save a collection to share your selection of sources.