Random infinite permutations and the cyclic time random walk. (English) Zbl 1073.60524
Branderier, Cyril (ed.) et al., Discrete random walks, DRW’03. Proceedings of the conference, Paris, France, September 1–5, 2003. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Math. Theor. Comput. Sci., Proc. AC, 9-16, electronic only (2003).
Summary: The random stirring process is a natural random walk on the set of permutations of the vertex set of a graph. The cyclic time random walk is a self interacting random walk on a graph. It is influenced by its past, in that it is constrained to repeat its past choices if it returns to a previously visited edge after a multiple of some period of time. The two models are fundamentally equivalent to each other as well as to a certain coalescence and fragmentation process.
For the entire collection see [Zbl 1031.68086].
For the entire collection see [Zbl 1031.68086].
MSC:
| 60G50 | Sums of independent random variables; random walks |
| 60K35 | Interacting random processes; statistical mechanics type models; percolation theory |
| 82B41 | Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics |
