Home | Contents | Submissions, editors, etc. | Login | Search | EJP
 Electronic Communications in Probability > Vol. 14 (2009) > Paper 35 open journal systems 


Rate of Escape of the Mixer Chain

Ariel Yadin, Weizmann Institute


Abstract
The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph, at each step either moving to a randomly chosen neighbor, or swapping the tile at its current position with some randomly chosen adjacent tile. We study the mixer chain on Z, and show that at time t the expected distance to the origin is t3/4D, up to constants. This is a new example of a random walk on a group with rate of escape strictly between t1/2 and t.


Full text: PDF

Pages: 347-357

Published on: August 26, 2009
Bibliography
  1. A. Erschler (Dyubina). On the asymptotics of the drift. Journal of Mathematical Sciences 121 (2004), 2437-2440. Math. Review 2003a:60065
  2. A. Erschler. On drift and entropy growth for random walks on groups. Annals of Probability 31 (2003), 1193-1204. Math. Review 2004c:60018
  3. V.A. Kaimanovich and A.M. Vershik. Random walks on discrete groups: boundary and entropy. Annals of Probability 11 (1983), 457-490. Math. Review 85d:60024
  4. D. Revelle. Rate of escape of random walks on wreath products and related groups. Annals of Probability 31 (2003), 1917-1934. Math. Review 2005a:60070
  5. P. Revesz. Random Walk in Random and Non-Random Environments. World Scientific Publishing Co., (2005). Math. Review 2006e:60003
















Research
Support Tool
Capture Cite
View Metadata
Printer Friendly
Context
Author Address
Action
Email Author
Email Others


Home | Contents | Submissions, editors, etc. | Login | Search | EJP

Electronic Communications in Probability. ISSN: 1083-589X