Fast distributed random walks

DOI10.1145/1582716.1582745MaRDI QIDQ5170313zbMATH OpenOpenAlexFDO

Authors Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan

Publication date 23 July 2014

Published in Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1582716.1582745

zbMATH Keywords

distributed algorithmMetropolis-Hastings samplingrandom samplingrandom walks

Mathematics Subject Classification ID

Random walks on graphs (05C81) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Recommendations

• Distributed random walks
• Efficient distributed random walks with applications
• Fast distributed computation in dynamic networks via random walks
• Distributed computation in dynamic networks via random walks
• A tight unconditional lower bound on distributed randomwalk computation

Cited in

(14)

• Random walks, heat equation and distributed algorithms
• Sampling-based algorithm for link prediction in temporal networks
• Distributed computation in dynamic networks via random walks
• DEX: self-healing expanders
• A tight unconditional lower bound on distributed randomwalk computation
• How Well Do Random Walks Parallelize?
• Fast distributed PageRank computation
• Fast distributed computation in dynamic networks via random walks
• Efficient distributed random walks with applications
• Peer counting and sampling in overlay networks, random walk methods
• Many Random Walks Are Faster Than One
• Distributed random walks
• Termination of amnesiac flooding
• Distributed PageRank computation with improved round complexities

This page was built for publication: Fast distributed random walks

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