Robustness of randomized rumour spreading

DOI10.1017/S0963548320000310zbMath1466.05200arXiv1902.07618MaRDI QIDQ4993120

Rami Daknama, Simon Reisser, Konstantinos D. Panagiotou

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

Szemerédi's regularity lemmalocal resiliencebroadcast protocols

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Asymptotics for pull on the complete graph ⋮ Bounds on expected propagation time of probabilistic zero forcing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• On the runtime and robustness of randomized broadcasting
• On the resilience of long cycles in random graphs
• The shortest-path problem for graphs with random arc-lengths
• Rumor spreading with bounded in-degree
• Asynchronous rumor spreading on random graphs
• Tight lower bound on the probability of a binomial exceeding its expectation
• Unzerlegbare, nicht negative Matrizen
• On the Push&Pull Protocol for Rumour Spreading
• Simple, Fast and Deterministic Gossip and Rumor Spreading
• Randomized broadcast in networks
• Expander graphs and their applications
• Rumor Spreading on Random Regular Graphs and Expanders
• Local resilience of graphs
• Rumor Spreading and Conductance
• The String of Diamonds Is Tight for Rumor Spreading
• Tight Analysis of Randomized Rumor Spreading in Complete Graphs
• Randomized Rumour Spreading: The Effect of the Network Topology
• Tight Bounds for Rumor Spreading with Vertex Expansion
• Global computation in a poorly connected world
• Social networks spread rumors in sublogarithmic time
• Advanced Lectures on Machine Learning

This page was built for publication: Robustness of randomized rumour spreading