Probabilistic Analysis of Rumor-Spreading Time
From MaRDI portal
Publication:5139858
DOI10.1287/ijoc.2018.0845zbMath1451.90030OpenAlexW2773586560WikidataQ127498159 ScholiaQ127498159MaRDI QIDQ5139858
Emmanuelle Anceaume, Yves Mocquard, Bruno Sericola
Publication date: 11 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0845
Related Items (7)
Stateless Information Dissemination Algorithms ⋮ Uncertain spreading model of Internet rumors on social media platforms ⋮ Rumors' spread: a game theoretical approach with the replicator dynamics ⋮ Sharp Thresholds in Random Simple Temporal Graphs ⋮ Can the indifferent population affect the spread of rumors? ⋮ Stochastic analysis of average-based distributed algorithms ⋮ Synchronous concurrent broadcasts for intermittent channels with bounded capacities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rumor spreading in social networks
- The shortest-path problem for graphs with random arc-lengths
- Rumor spreading with bounded in-degree
- Fast computation by population protocols with a leader
- Asynchronous rumor spreading on random graphs
- Rumor spreading in random evolving graphs
- On the Push&Pull Protocol for Rumour Spreading
- Rumor spreading on random regular graphs and expanders
- Resource discovery in distributed networks
- Randomized broadcast in networks
- On a Daley-Kendall model of random rumours
- Two Markov Models of the Spread of Rumors
- On Spreading a Rumor
- Markov Chains
- Randomized Rumour Spreading: The Effect of the Network Topology
- Tight Bounds for Rumor Spreading with Vertex Expansion
- Global computation in a poorly connected world
- Constrained information transmission on Erd\"os-R\'enyi graphs
This page was built for publication: Probabilistic Analysis of Rumor-Spreading Time
