Rate of Escape of the Mixer Chain
| dc.creator | Yadin, Ariel | |
| dc.date | 2005-06-08 | |
| dc.date | 2009-01-13 | |
| dc.date.accessioned | 2026-07-07T12:28:28Z | |
| dc.date.available | 2026-07-07T12:28:28Z | |
| dc.description | 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 t^{3/4}, up to constants. This is a new example of a random walk on a group with rate of escape strictly between t^{1/2} and t. | |
| dc.identifier | https://arxiv.org/abs/math/0506129 | |
| dc.identifier | http://arxiv.org/abs/math/0506129 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/215550 | |
| dc.subject | Probability | |
| dc.subject | Group Theory | |
| dc.subject | 60J10, 60B15 | |
| dc.title | Rate of Escape of the Mixer Chain | |
| dc.type | text |