Rumor Spreading on Random Regular Graphs and Expanders
From MaRDI portal
Publication:3588435
DOI10.1007/978-3-642-15369-3_42zbMath1305.68136OpenAlexW1984815674MaRDI QIDQ3588435
Nikolaos Fountoulakis, Konstantinos D. Panagiotou
Publication date: 10 September 2010
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_42
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)
Related Items (12)
Diameter and broadcast time of random geometric graphs in arbitrary dimensions ⋮ Push is Fast on Sparse Random Graphs ⋮ Rumors' spread: a game theoretical approach with the replicator dynamics ⋮ Randomized Rumour Spreading: The Effect of the Network Topology ⋮ Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ The worst case behavior of randomized gossip protocols ⋮ Faster rumor spreading with multiple calls ⋮ Unnamed Item ⋮ Asymptotics for push on the complete graph ⋮ Randomized rumor spreading in poorly connected small-world networks ⋮ Robustness of randomized rumour spreading ⋮ Unnamed Item
This page was built for publication: Rumor Spreading on Random Regular Graphs and Expanders
