Skip to Main content Skip to Navigation
Journal articles

Random walk on sparse random digraphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [39 references]  Display  Hide  Download
Contributor : Justin Salez <>
Submitted on : Thursday, August 27, 2015 - 9:37:07 AM
Last modification on : Thursday, June 18, 2020 - 12:46:02 PM
Document(s) archivé(s) le : Saturday, November 28, 2015 - 10:22:57 AM


Files produced by the author(s)



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



Record views


Files downloads