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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Mukherjee, Chiranjib, Recke, Konstantin
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914515451379712
author Mukherjee, Chiranjib
Recke, Konstantin
author_facet Mukherjee, Chiranjib
Recke, Konstantin
contents 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 $α\in[0,1]$ if and only if the $L^1$-compression exponent of the graph is at least $α$, 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 $L^1$-compression exponents.
format Preprint
id arxiv_https___arxiv_org_abs_2406_04222
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Coarse embeddability, $L^1$-compression and Percolations on General Graphs
Mukherjee, Chiranjib
Recke, Konstantin
Probability
Metric Geometry
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 $α\in[0,1]$ if and only if the $L^1$-compression exponent of the graph is at least $α$, 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 $L^1$-compression exponents.
title Coarse embeddability, $L^1$-compression and Percolations on General Graphs
topic Probability
Metric Geometry
url https://arxiv.org/abs/2406.04222