Random Infinite Permutations and the Cyclic Time Random Walk - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2003

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.
Fichier principal
Vignette du fichier
dmAC0101.pdf (87.69 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01183937 , version 1 (12-08-2015)

Identifiers

Cite

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⟩

Collections

INSMI TDS-MACS
66 View
644 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More