Searcharxiv⌕ Search

arXiv · 0708.0853

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 α\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)^α. In particular, the Hilbert compression exponent (respectively the equivariant Hilbert compression exponent) of G is α^*(G)=α^*_{L_2}(G) (respectively α^#(G)= α_{L_2}^#(G)). We show that if X has modulus of smoothness of power type p, then α^#_X(G)\le \frac{1}{pβ^*(G)}. Here β^*(G) is the largest β\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^β, where \{W_t\}_{t=0}^\infty 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=L_p, generalizes a theorem of Guentner and Kaminker and answers a question posed by Tessera. We also show that if α^*(G)\ge 1/2 then α^*(G\bwr \Z)\ge \frac{2α^*(G)}{2α^*(G)+1}. This improves the previous bound due to Stalder and ValetteWe deduce that if we write \Z_{(1)}= \Z and \Z_{(k+1)}\coloneqq \Z_{(k)}\bwr \Z then α^*(\Z_{(k)})=\frac{1}{2-2^{1-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 C_2\bwr C_n embed into L_1 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Assaf Naor, Yuval Peres. 2007-09-02. Embeddings of discrete groups and the speed of random walks. https://arxiv.org/abs/0708.0853

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Napoleonic triangles on the sphere from similar chord triangles

We study a variant of Napoleon's construction on the unit sphere, in which the triangles erected on the sides of a spherical triangle $ABC$ are required to have similar isosceles chord triangles with apex angle $β\in(0,π/2)$. For a non-equilateral $ABC$, we prove that the triangle $XYZ$ of spherical circumcentres is equilateral if and only if $\cos(θ_a+θ_b+θ_c\pmΩ/2)=0$, where $θ_a,θ_b,θ_c$ are the base angles of the isosceles spherical triangles $XBC$, $YCA$, $ZAB$, $Ω$ is the area of $ABC$, and the sign $+$ (resp.~$-$) corresponds to the outward (resp.~inward) construction. We derive from this an explicit classification in terms of two quadrics and a cubic inequality. It recovers the theorem of Dipierro, Noakes and Valdinoci for $β=π/3$, and exhibits three families of solutions for $β>π/3$, together with a fourth one when $\cosβ<1/4$.

math.MG↗

Metric geometry for ranking-based voting: Tools for learning electoral structure

In this paper, we develop the metric geometry of ranking statistics, proving that the two major permutation distances in the statistics literature -- Kendall tau and Spearman footrule -- extend naturally to incomplete rankings with both coordinate embeddings and graph realizations. This gives us a unifying framework that allows us to connect popular topics in computational social choice: metric preferences (and metric distortion), polarization, and proportionality. As an important application, the metric structure enables efficient identification of blocs of voters and slates of their preferred candidates. Since the definitions work for partial ballots, we can execute the methods not only on synthetic elections, but on a suite of real-world elections. This gives us robust clustering methods that often produce an identical grouping of voters -- even though one family of methods is based on a Condorcet-consistent ranking rule while the other is not.

math.MG↗

Local stability for the truncated octahedral conjecture

This note proves that the truncated octahedron of Archimedes is a strict local minimizer of the isoperimetric quotient among parallelohedra in three dimensions. This extends the corresponding result from the five-dimensional lattice-Voronoi subclass to the full ten-dimensional local parameter space. A six-zone parametrization and Schur's lemma reduce the Hessian to two positive definite $2\times 2$ matrices.

math.MG↗