Stochastic rumors on random trees
arXiv:2109.02564 · doi:10.1088/1742-5468/ac3b45
Abstract
The Maki-Thompson rumor model is defined by assuming that a population represented by a graph is subdivided into three classes of individuals; namely, ignorants, spreaders and stiflers. A spreader tells the rumor to any of its nearest ignorant neighbors at rate one. At the same rate, a spreader becomes a stifler after a contact with other nearest neighbor spreaders, or stiflers. In this work we study the model on random trees. As usual we define a critical parameter of the model as the critical value around which the rumor either becomes extinct almost-surely or survives with positive probability. We analyze the existence of phase-transition regarding the survival of the rumor, and we obtain estimates for the mean range of the rumor. The applicability of our results is illustrated with examples on random trees generated from some well-known discrete distributions.
References in corpus (9)
- Dynamics of Rumor Spreading in Complex Networks
- Theory of Rumour Spreading in Complex Social Networks
- Dynamics of rumor propagation on small-world networks
- On the behaviour of a rumour process with random stifling
- A spatial stochastic model for rumor transmission
- Branching process descriptions of information cascades on Twitter
- Phase transition for the Maki-Thompson rumour model on a small-world network
- Information Transmission under Random Emission Constraints
- The Maki-Thompson rumor model on infinite Cayley trees