Random walks on graphs: new bounds on hitting, meeting, coalescing and returning

DOI10.1137/1.9781611975505.13zbMath1433.05287arXiv1807.06858OpenAlexW2882978176MaRDI QIDQ5195240

Yuval Peres, Roberto Imbuzeiro Oliveira

Publication date: 18 September 2019

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

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

zbMATH Keywords

lazy random walks on finite graphs

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27) Random walks on graphs (05C81)

Related Items (9)

Reversible random walks on dynamic graphs ⋮ Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models ⋮ On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ On the meeting of random walks on random DFA ⋮ Brief Announcement: Discrete Incremental Voting ⋮ Estimating graph parameters with random walks ⋮ Coalescing and branching simple symmetric exclusion process ⋮ Sharp bounds on eigenvalues via spectral embedding based on signless Laplacians

This page was built for publication: Random walks on graphs: new bounds on hitting, meeting, coalescing and returning