Random Infinite Permutations and the Cyclic Time Random Walk - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2003

Random Infinite Permutations and the Cyclic Time Random Walk

Résumé

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
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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

TDS-MACS
75 Consultations
719 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More