On the Push&Pull Protocol for Rumor Spreading
From MaRDI portal
Publication:5346546
DOI10.1137/15M1033113zbMath1362.05119MaRDI QIDQ5346546
Abbas Mehrabian, Hüseyin Acan, Andrea Collevecchio, Nicholas C. Wormald
Publication date: 24 May 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Social networks; opinion dynamics (91D30) Combinatorial probability (60C05) Randomized algorithms (68W20) Distributed algorithms (68W15) Random walks on graphs (05C81)
Related Items
Broadcasting on paths and cycles ⋮ ILSCR rumor spreading model to discuss the control of rumor spreading in emergency ⋮ Effects of online and offline interaction on rumor propagation in activity-driven networks ⋮ On broadcasting time in the model of travelling agents ⋮ Immune sets in monotone infection rules. Characterization and complexity ⋮ The String of Diamonds Is Tight for Rumor Spreading ⋮ The string of diamonds is nearly tight for rumour spreading
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
- On the runtime and robustness of randomized broadcasting
- On mixing and edge expansion properties in randomized broadcasting
- Asynchronous rumor spreading on random graphs
- Randomized rumor spreading in poorly connected small-world networks
- Rumor spreading on random regular graphs and expanders
- Asynchronous Rumor Spreading in Preferential Attachment Graphs
- Resource discovery in distributed networks
- Randomized broadcast in networks
- A survey of gossiping and broadcasting in communication networks
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Flooding in Weighted Sparse Random Graphs
- How Asynchrony Affects Rumor Spreading Time
- Tight Bounds for Rumor Spreading with Vertex Expansion
- Social networks spread rumors in sublogarithmic time
This page was built for publication: On the Push&Pull Protocol for Rumor Spreading
