Skip to Main content Skip to Navigation
Conference papers

Random Infinite Permutations and the Cyclic Time Random Walk

Abstract : 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.
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/hal-01183937
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 9:08:08 AM
Last modification on : Thursday, October 15, 2020 - 2:42:03 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:38:04 AM

File

dmAC0101.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Omer Angel. Random Infinite Permutations and the Cyclic Time Random Walk. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.9-16, ⟨10.46298/dmtcs.3342⟩. ⟨hal-01183937⟩

Share

Metrics

Record views

65

Files downloads

548