On the Push&Pull Protocol for Rumor Spreading
From MaRDI portal
Publication:5346546
DOI10.1137/15M1033113zbMATH Open1362.05119MaRDI QIDQ5346546FDOQ5346546
Authors: Hüseyin Acan, Andrea Collevecchio, Abbas Mehrabian, Nicholas Wormald 
Publication date: 24 May 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
- On the Push\&Pull protocol for rumour spreading (extended abstract)
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- Simple and optimal randomized fault-tolerant rumor spreading
- Randomized rumor spreading revisited
- Strong robustness of randomized rumor spreading protocols
- Strong robustness of randomized rumor spreading protocols
- Stochastic analysis of rumor spreading with multiple pull operations
- Breaking the \(\log n\) barrier on rumor spreading
- Randomized Rumor Spreading in Dynamic Graphs
- Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
Randomized algorithms (68W20) Social networks; opinion dynamics (91D30) Combinatorial probability (60C05) Random walks on graphs (05C81) Distributed algorithms (68W15)
Cites Work
- Probability and random processes.
- On the spread of viruses on the Internet
- A survey of gossiping and broadcasting in communication networks
- Title not available (Why is that?)
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Title not available (Why is that?)
- On the runtime and robustness of randomized broadcasting
- Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
- Randomized broadcast in networks
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- On mixing and edge expansion properties in randomized broadcasting
- Social networks spread rumors in sublogarithmic time
- Title not available (Why is that?)
- Tight bounds for rumor spreading in graphs of a given conductance
- Title not available (Why is that?)
- Resource discovery in distributed networks
- Title not available (Why is that?)
- Rumor spreading on random regular graphs and expanders
- Asynchronous Rumor Spreading in Preferential Attachment Graphs
- Ultra-fast rumor spreading in social networks
- Randomized rumor spreading in poorly connected small-world networks
- How asynchrony affects rumor spreading time
- Tight bounds for rumor spreading with vertex expansion
- Flooding in weighted sparse random graphs
Cited In (14)
- Effects of online and offline interaction on rumor propagation in activity-driven networks
- The String of Diamonds Is Tight for Rumor Spreading
- Ultra-fast rumor spreading in social networks
- Broadcasting on paths and cycles
- On the Push\&Pull protocol for rumour spreading (extended abstract)
- How asynchrony affects rumor spreading time
- On broadcasting time in the model of travelling agents
- Stochastic analysis of rumor spreading with multiple pull operations
- Rumor spreading and conductance
- ILSCR rumor spreading model to discuss the control of rumor spreading in emergency
- Immune sets in monotone infection rules. Characterization and complexity
- Who started this rumor? Quantifying the natural differential privacy of gossip protocols
- The string of diamonds is nearly tight for rumour spreading
- Asymptotics for pull on the complete graph
This page was built for publication: On the Push&Pull Protocol for Rumor Spreading
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346546)
