Distributed Random Walks
From MaRDI portal
Publication:5395702
DOI10.1145/2432622.2432624zbMath1281.68225arXiv1302.4544OpenAlexW2057037070WikidataQ105584197 ScholiaQ105584197MaRDI QIDQ5395702
Gopal Pandurangan, Atish Das Sarma, Danupon Nanongkai, Prasad Tetali
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.4544
random walksmixing timerandom samplingdistributed algorithmsrandom spanning treedecentralized computation
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Random walks on graphs (05C81)
Related Items (10)
What can be sampled locally? ⋮ Multiple random walks on graphs: mixing few to cover many ⋮ A parallel pagerank algorithm for undirected graph ⋮ Unnamed Item ⋮ Fast distributed PageRank computation ⋮ Improving resource location with locally precomputed partial random walks ⋮ Fast distributed algorithms for testing graph properties ⋮ Sampling-based algorithm for link prediction in temporal networks ⋮ Estimating graph parameters with random walks ⋮ Distributed computation in dynamic networks via random walks
This page was built for publication: Distributed Random Walks
