Random Infinite Permutations and the Cyclic Time Random WalkArticle
Authors: Omer Angel 1
NULL
Omer Angel
1 Department of Mathematics
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.
Volker Betz;Johannes Ehlert;Benjamin Lees;Lukas Roth, 2021, Sharp phase transition for random loop models on trees, Electronic Journal of Probability, 26, none, 10.1214/21-ejp677, https://doi.org/10.1214/21-ejp677.
Radosław Adamczak;Michał Kotowski;Piotr Miłoś, 2021, Phase transition for the interchange and quantum Heisenberg models on the Hamming graph, arXiv (Cornell University), 57, 1, 10.1214/20-aihp1079, https://arxiv.org/abs/1808.08902.
Peter Mühlbacher, 2021, Critical parameters for loop and Bernoulli percolation, ALEA-Latin American Journal of Probability and Mathematical Statistics, 18, 1, pp. 289, 10.30757/alea.v18-13, https://doi.org/10.30757/alea.v18-13.
Piotr Miłoś;Batı Şengül, 2019, Existence of a phase transition of the interchange process on the Hamming graph, Electronic Journal of Probability, 24, none, 10.1214/18-ejp171, https://doi.org/10.1214/18-ejp171.
Jakob E. Björnberg;Michał Kotowski;Benjamin Lees;Piotr Miłoś, 2019, The interchange process with reversals on the complete graph, Electronic Journal of Probability, 24, none, 10.1214/19-ejp366, https://doi.org/10.1214/19-ejp366.
Nathanael Berestycki, 2011, Emergence of Giant Cycles and Slowdown Transition in Random Transpositions and $k$-Cycles, Electronic Journal of Probability, 16, none, 10.1214/ejp.v16-850, https://doi.org/10.1214/ejp.v16-850.