How to compute times of random walks based distributed algorithms

MaRDI QIDQ5431927zbMATH OpenFDO

Authors Alain Bui, Devan Sohier

Publication date 2 January 2008

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Distributed random walks
• Efficient distributed random walks with applications
• Distributed computation in dynamic networks via random walks
• Fast distributed computation in dynamic networks via random walks
• Cover time and mixing time of random walks on dynamic graphs

Cited in

(4)

• Random walks, heat equation and distributed algorithms
• How Well Do Random Walks Parallelize?
• Efficient distributed random walks with applications
• On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems

This page was built for publication: How to compute times of random walks based distributed algorithms

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