Embeddings of discrete groups and the speed of random walks

Abstract

For a finitely generated group G and a banach space X let α*X(G) (respectively α#X(G)) be the supremum over all α 0 such that there exists a Lipschitz mapping (respectively an equivariant mapping) f:G X and c>0 such that for all x,y∈ G we have \|f(x)-f(y)\| c· dG(x,y)α. In particular, the Hilbert compression exponent (respectively the equivariant Hilbert compression exponent) of G is α*(G)=α*L2(G) (respectively α#(G)= αL2#(G)). We show that if X has modulus of smoothness of power type p, then α#X(G) 1pβ*(G). Here β*(G) is the largest β 0 for which there exists a set of generators S of G and c>0 such that for all t∈ we have [dG(Wt,e)] ctβ, where \Wt\t=0∞ is the canonical simple random walk on the Cayley graph of G determined by S, starting at the identity element. This result is sharp when X=Lp, generalizes a theorem of Guentner and Kaminker and answers a question posed by Tessera. We also show that if α*(G) 1/2 then α*(G ) 2α*(G)2α*(G)+1. This improves the previous bound due to Stalder and ValetteWe deduce that if we write (1)= and (k+1) (k) then α*((k))=12-21-k, and use this result to answer a question posed by Tessera in on the relation between the Hilbert compression exponent and the isoperimetric profile of the balls in G. We also show that the cyclic lamplighter groups C2 Cn embed into L1 with uniformly bounded distortion, answering a question posed by Lee, Naor and Peres. Finally, we use these results to show that edge Markov type need not imply Enflo type.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…