Tight Bounds for Rumor Spreading with Vertex Expansion
From MaRDI portal
Publication:5384020
DOI10.1137/1.9781611973402.59zbMath1421.68128arXiv1302.6243OpenAlexW2949091638MaRDI QIDQ5384020
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.6243
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Network protocols (68M12)
Related Items
Stochastic analysis of rumor spreading with multiple pull operations, On the Push&Pull Protocol for Rumor Spreading, Continuous-time stochastic analysis of rumor spreading with multiple operations, Rumor Spreading with No Dependence on Conductance, Geometric bounds on the fastest mixing Markov chain, Asymptotics for pull on the complete graph, Probabilistic Analysis of Rumor-Spreading Time, Unnamed Item, Asymptotics for push on the complete graph, Rumor spreading with bounded in-degree, Robustness of randomized rumour spreading, Self-organizing flows in social networks