# On Rumour Propagation Among Sceptics

```@article{AlsadatSajadi2018OnRP,
title={On Rumour Propagation Among Sceptics},
journal={Journal of Statistical Physics},
year={2018},
volume={174},
pages={935-952}
}```
• Published 9 June 2017
• Mathematics
• Journal of Statistical Physics
Junior et al. (J Appl Probab 48:624–636, 2011) studied a model to understand the spread of a rumour. Their model consists of individuals situated at the integer points of the line \$\$\mathbb {N}\$\$N. An individual at the origin 0 starts a rumour and passes it to all individuals in the interval \$\$[0,R_0]\$\$[0,R0], where \$\$R_0\$\$R0 is a non-negative random variable. An individual located at i in this interval receives the rumour and transmits it further among individuals in \$\$[i, i+R_i]\$\$[i,i+Ri…
3 Citations
A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model
• Computer Science
Proceedings of the Royal Society A
• 2020
A multi-type bootstrap percolation model, which is called T-Bootstrap Percolation (T-BP), is introduced, and its implications when applied to rumour spread, fake news and marketing strategies are described.
A Complete Bibliography of the Journal of Statistical Physics: 2000{2009
(2 + 1) [XTpXpH12, CTH11]. + [Zuc11b]. 0 [Fed17]. 1 [BELP15, CAS11, Cor16, Fed17, GDL10, GBL16, Hau16, JV19, KT12, KM19c, Li19, MN14b, Nak17, Pal11, Pan14, RT14, RBS16b, RY12, SS18c, Sug10, dOP18]. 1

## References

SHOWING 1-10 OF 19 REFERENCES
Rumor Processes on \$\$\mathbb {N}\$\$N and Discrete Renewal Processes
• Mathematics
• 2014
Two rumor processes on N, the dynamics of which are related to an SI epidemic model with long range transmission, are studied, showing that, in each model, the position of the spreaders on N can be related to a suitably chosen discrete renewal process.
Rumor Processes in Random Environment on \$\mathbb{N}\$ and on Galton–Watson Trees
• Mathematics
• 2013
The aim of this paper is to study rumor processes in random environment. In a rumor process a signal starts from the stations of a fixed vertex (the root) and travels on a graph from vertex to
Rumor processes on N
• Mathematics
• 2011
We study four discrete time stochastic systems on \$\bbN\$ modeling processes of rumour spreading. The involved individuals can either have an active or a passive role, speaking up or asking for the
The Rumor Percolation Model and Its Variations
• Mathematics
Sojourns in Probability Theory and Statistical Physics - II
• 2019
The study of rumor models from a percolation theory point of view has gained a few adepts in the last few years. The persistence of a rumor, which may consistently spread out throughout a population
On the coverage of space by random sets
• Mathematics
• 2004
Let ξ1, ξ2,… be a Poisson point process of density λ on (0,∞) d , d ≥ 1, and let ρ, ρ1, ρ2,… be i.i.d. positive random variables independent of the point process. Let C := ⋃ i≥1 {ξ i + [0,ρ i ] d }.
The proportion of the population never hearing a rumour
• A. Sudbury
• Mathematics
Journal of Applied Probability
• 1985
For a model of a rumour, first given a non-rigorous treatment by Maki and Thompson, it is shown that the proportion of the population never hearing the rumour converges in probability to 0.203 as the
Critical Power for Asymptotic Connectivity in Wireless Networks
• Computer Science
• 1999
In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In
Stochastic Geometry and Its Applications
• Mathematics, Computer Science
• 2009
Random Closed Sets I--The Boolean Model. Random Closed Sets II--The General Case.
Random networks for communication : from statistical physics to information systems
• Computer Science
• 2008
The results suggest that phase transitions in infinite networks are more random than in the case of finite networks, where information flow in random networks is more orderly.
Random Geometric Graphs
This chapter discusses probabilistic ingredients, the largest component for a binomial process, and connectedivity and the number of components in a graph-like model.