Random walk on sparse random digraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Probability Theory and Related Fields Année : 2018

Random walk on sparse random digraphs

Random walk on sparse random digraphs

Résumé

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the context of card shuffling (Aldous-Diaconis, 1986), this remarkable phenomenon is now rigorously established for many reversible chains. Here we consider the non-reversible case of random walks on sparse directed graphs, for which even the equilibrium measure is far from being understood. We work under the configuration model, allowing both the in-degrees and the out-degrees to be freely specified. We establish the cutoff phenomenon, determine its precise window and prove that the cutoff profile approaches a universal shape. We also provide a detailed description of the equilibrium measure.
Fichier principal
Vignette du fichier
rwrd.pdf (326.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01187523 , version 1 (27-08-2015)

Identifiants

Citer

Charles Bordenave, Pietro Caputo, Justin Salez. Random walk on sparse random digraphs. Probability Theory and Related Fields, 2018, 170 (3-4), pp.933-960. ⟨10.1007/s00440-017-0796-7⟩. ⟨hal-01187523⟩
304 Consultations
243 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More