On the joint behaviour of speed and entropy of random walks on groups

Abstract

For every 3/4 δ, β< 1 satisfying δ≤ β < 1+δ2 we construct a finitely generated group and a (symmetric, finitely supported) random walk Xn on so that its expected distance from its starting point satisfies E|Xn| nβ and its entropy satisfies H(Xn) nδ. In fact, the speed and entropy can be set precisely to equal any two nice enough prescribed functions f,h up to a constant factor as long as the functions satisfy the relation n34≤ h(n)≤ f(n)≤ nh(n)/ (n+1)≤ nγ for some γ<1.

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…