scientific article; zbMATH DE number 524141

zbMath0791.60055MaRDI QIDQ4284630

Peter M. Winkler, Prasad Tetali

Publication date: 18 April 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random walksreversible Markov chainsfunctions on graphs

Mathematics Subject Classification ID

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

Related Items (8)

The infection time of graphs ⋮ A note on expected hitting times for birth and death chains ⋮ Collecting coupons on trees, and the cover time of random walks ⋮ Avoidance couplings on non‐complete graphs ⋮ An Upper Bound on the Size of Avoidance Couplings ⋮ Improved approximation of the minimum cover time ⋮ Distributed probabilistic polling and applications to proportionate agreement ⋮ On the expected time for Herman's probabilistic self-stabilizing algorithm

This page was built for publication: