Fast distributed random walks

DOI10.1145/1582716.1582745zbMath1291.05189OpenAlexW2052312304MaRDI QIDQ5170313

Atish Das Sarma, Gopal Pandurangan, Danupon Nanongkai

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

random walksrandom samplingdistributed algorithmMetropolis-Hastings sampling

Mathematics Subject Classification ID

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

Related Items (4)

DEX: self-healing expanders ⋮ Termination of amnesiac flooding ⋮ Distributed PageRank computation with improved round complexities ⋮ Sampling-based algorithm for link prediction in temporal networks

This page was built for publication: Fast distributed random walks