Embeddings of discrete groups and the speed of random walks
Assaf Naor, Yuval Peres

TL;DR
This paper investigates the embeddings of finitely generated groups into Banach spaces, establishing bounds on compression exponents related to random walk behavior, and applies these results to specific groups and embedding problems.
Contribution
It introduces new bounds linking group embeddings, random walk properties, and Banach space geometry, generalizing previous theorems and answering open questions.
Findings
Bound lpha^#_X(G) by the modulus of smoothness of X and the random walk exponent eta^*(G)
Established lpha^*(Gwr \u211a) bounds based on lpha^*(G)
Embedded cyclic lamplighter groups into L_1 with bounded distortion
Abstract
For a finitely generated group G and a banach space X let \alpha^*_X(G) (respectively \alpha^#_X(G)) be the supremum over all \alpha\ge 0 such that there exists a Lipschitz mapping (respectively an equivariant mapping) f:G\to X and c>0 such that for all x,y\in G we have \|f(x)-f(y)\|\ge c\cdot d_G(x,y)^\alpha. In particular, the Hilbert compression exponent (respectively the equivariant Hilbert compression exponent) of G is \alpha^*(G)=\alpha^*_{L_2}(G) (respectively \alpha^#(G)= \alpha_{L_2}^#(G)). We show that if X has modulus of smoothness of power type p, then \alpha^#_X(G)\le \frac{1}{p\beta^*(G)}. Here \beta^*(G) is the largest \beta\ge 0 for which there exists a set of generators S of G and c>0 such that for all t\in \N we have \E\big[d_G(W_t,e)\big]\ge ct^\beta, where \{W_t\}_{t=0}^\infty is the canonical simple random walk on the Cayley graph of G determined by S, starting at…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Topological and Geometric Data Analysis · Advanced Operator Algebra Research
