Fast Distributed Computation in Dynamic Networks via Random Walks

DOI10.1007/978-3-642-33651-5_10zbMath1377.68315arXiv1205.5525OpenAlexW2068802752MaRDI QIDQ4909407

Gopal Pandurangan, Atish Das Sarma, Anisur Rahaman Molla

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.5525

zbMATH Keywords

random walksrandom samplingdistributed algorithmdynamic networkinformation disseminationgossip

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items (5)

Distributed Graph Algorithms and their Complexity: An Introduction ⋮ Smoothed analysis of dynamic networks ⋮ Discovery Through Gossip ⋮ Distributed computation in dynamic networks via random walks ⋮ Distributed agreement in dynamic peer-to-peer networks

This page was built for publication: Fast Distributed Computation in Dynamic Networks via Random Walks