Metric Poincaré inequalities for graphs

This article considers embeddings of bounded degree graphs into general metric spaces. Our first main result is a metric analogue of Matoušek's extrapolation that relates the Poincaré constants γ (G, ᵖ) and γ (G, q) for any pair of exponents 0 < p, q <, any bounded degree expander graph G, and any metric space M= (M, ). Our second main result provides a sharp estimate of the Poincaré constant γ (G, ) in terms of the cardinalities of the vertex set of G and the target metric space M= (M, ), in the setting of random graphs. Both theorems utilize a novel structural dichotomy for metric embeddings of graphs. These results lead to the resolution of several problems within the theory of metric embeddings. Among the applications are estimates on the nonlinear spectral gap of metric snowflakes, optimal estimates on the minimum cardinality of (bi-Lipschitz) universal metric spaces for graphs, and sharp lower bounds on the bi-Lipschitz distortion of random regular graphs into arbitrary metric spaces of large cardinality.