scientific article; zbMATH DE number 524141

zbMATH Open0791.60055MaRDI QIDQ4284630FDOQ4284630

Authors: Peter Winkler, Prasad Tetali 

Publication date: 18 April 1994

Title of this publication is not available (Why is that?)

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

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)

Cited In (14)

• 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
• An upper bound on the size of avoidance couplings
• Random walks colliding before getting trapped
• 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
• Title not available (Why is that?)
• Simultaneous recurrent conditions on countable state Markov chains
• The infection time of graphs
• Distributed probabilistic polling and applications to proportionate agreement
• Reversibility and equivalence in directed Markov fields
• Improved approximation of the minimum cover time

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)