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

Research output: Contribution to journalArticlepeer-review

Abstract

For every 3=4 ; < 1 satisfying 1C 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 EjXnj 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 for some.

Original languageEnglish
Pages (from-to)455-467
Number of pages13
JournalGroups, Geometry, and Dynamics
Volume11
Issue number2
DOIs
StatePublished - 2017

Keywords

  • Automaton groups.d
  • Entropy
  • Groups
  • Permutation wreath product
  • Random walk
  • Rate of escape

All Science Journal Classification (ASJC) codes

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'On the joint behaviour of speed and entropy of random walks on groups'. Together they form a unique fingerprint.

Cite this