scientific article; zbMATH DE number 524141

MaRDI QIDQ4284630zbMATH OpenFDO

Authors Peter Winkler, Prasad Tetali

Publication date 18 April 1994

zbMATH Keywords

random walksreversible Markov chainsfunctions on graphs

Mathematics Subject Classification ID

Trees (05C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sums of independent random variables; random walks (60G50)

Recommendations

• Collisions Among Random Walks on a Graph
• On the cover time of random walks on graphs
• Meeting times for independent Markov chains
• Meeting times of random walks on graphs
• A note on expected hitting times for birth and death chains

Cited in

(14)

• Reversibility and equivalence in directed Markov fields
• Improved approximation of the minimum cover time
• Collecting coupons on trees, and the cover time of random walks
• On the expected time for Herman's probabilistic self-stabilizing algorithm
• Collisions Among Random Walks on a Graph
• Random walks colliding before getting trapped
• An upper bound on the size of avoidance couplings
• A method for determining the reversibility of a Markov sequence
• A note on expected hitting times for birth and death chains
• Avoidance couplings on non‐complete graphs
• scientific article; zbMATH DE number 4203403 (Why is no real title available?)
• Simultaneous recurrent conditions on countable state Markov chains
• The infection time of graphs
• Distributed probabilistic polling and applications to proportionate agreement

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284630)