Permuted Random Walk Exits Typically in Linear Time

DOI10.1137/1.9781611973204.7zbMath1430.05117arXiv1405.3290OpenAlexW300015790MaRDI QIDQ5194759

Shirshendu Ganguly, Yuval Peres

Publication date: 17 September 2019

Published in: 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.3290

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Random walks on graphs (05C81)

Related Items (3)

Random walks on regular trees can not be slowed down ⋮ Speeding up Markov chains with deterministic jumps ⋮ Correction to: ``Speeding up Markov chains with deterministic jumps

This page was built for publication: Permuted Random Walk Exits Typically in Linear Time