English

Coarse embeddability, $L^1$-compression and Percolations on General Graphs

Probability 2026-04-30 v3 Metric Geometry

Abstract

We show that a locally finite, connected graph has a coarse embedding into a Hilbert space if and only if there exist bond percolations with arbitrarily large marginals and two-point function vanishing at infinity. We further show that the decay of the two-point function is stretched exponential with stretching exponent α[0,1]\alpha\in[0,1] if and only if the L1L^1-compression exponent of the graph is at least α\alpha, leading to a probabilistic characterization of this exponent. These results are new even in the particular setting of Cayley graphs of finitely generated groups. The proofs build on new probabilistic methods introduced recently by the authors to study group-invariant percolation on Cayley graphs [28,29], which are now extended to the general, non-symmetric situation of graphs to study their coarse embeddability and L1L^1-compression exponents.

Keywords

Cite

@article{arxiv.2406.04222,
  title  = {Coarse embeddability, $L^1$-compression and Percolations on General Graphs},
  author = {Chiranjib Mukherjee and Konstantin Recke},
  journal= {arXiv preprint arXiv:2406.04222},
  year   = {2026}
}

Comments

Minor revisions in the exposition, remarks and literature

R2 v1 2026-06-28T16:56:07.910Z