Hostname: page-component-76fb5796d-5g6vh Total loading time: 0 Render date: 2024-04-28T11:19:19.999Z Has data issue: false hasContentIssue false
  • English
  • Français

On the probability of rumour survival among sceptics

Part of: Markov processes Special processes

Published online by Cambridge University Press:  02 March 2023

Neda Esmaeeli Open the ORCID record for Neda Esmaeeli [Opens in a new window]  and
Farkhondeh Alsadat Sajadi
Neda Esmaeeli*
Affiliation:
University of Isfahan
Farkhondeh Alsadat Sajadi*
Affiliation:
University of Isfahan
*
*Postal address: Department of Applied Mathematics and Computer Science, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan 81746-73441, Iran. Email address: n.esmaeeli@sci.ui.ac.ir
**Postal address: Department of Statistics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan 81746-73441, Iran. Email address: f.sajadi@sci.ui.ac.ir
Get access Rights & Permissions [Opens in a new window]

Abstract

We study a sceptical rumour model on the non-negative integer line. The model starts with two spreaders at sites 0, 1 and sceptical ignorants at all other natural numbers. Then each sceptic transmits the rumour, independently, to the individuals within a random distance on its right after s/he receives the rumour from at least two different sources. We say that the process survives if the size of the set of vertices which heard the rumour in this fashion is infinite. We calculate the probability of survival exactly, and obtain some bounds for the tail distribution of the final range of the rumour among sceptics. We also prove that the rumour dies out among non-sceptics and sceptics, under the same condition.

Keywords

Rumour processrenewal processdouble coverage

MSC classification

Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory
Secondary: 60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
Type
Original Article
Information
Journal of Applied Probability , Volume 60 , Issue 3 , September 2023 , pp. 1096 - 1111
Check for updates
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of Applied Probability Trust

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Athreya, S., Roy, R. and Sarkar, A. (2004). On the coverage of space by random sets. Adv. Appl. Prob. 36, 1–18.CrossRefGoogle Scholar
Berger, N., Borgs, C., Chayes, J. T. and Saberi, A. (2005). On the spread of viruses on the internet. In Proceedings of the Sixteenth Annual ACM–SIAM Symposium on Discrete Algorithms (SODA ’05), pp. 301–310.Google Scholar
Bertacchi, D. and Zucca, F. (2013). Rumour processes in random environment on ${\mathbb N}$ and on Galton–Watson trees. J. Statist. Phys. 153, 486–511.CrossRefGoogle Scholar
Bressaud, X., Fernández, R. and Galves, A. (1999). Decay of correlations for non-Hölderian dynamics: a coupling approach. Electron. J. Prob. 4, 1–19.CrossRefGoogle Scholar
Coletti, C. F., Rodrguez, P. M. and Schinazi, R. B. (2012). A spatial stochastic model for rumor transmission. J. Statist. Phys. 147, 375–381.CrossRefGoogle Scholar
Comets, F., Delarue, D. and Schott, R. (2013). Information transmission under random emission constraints. Combinatorics Prob. Comput. 23, 973–1009.CrossRefGoogle Scholar
Daley, D. J. and Kendall, D. G. (1965). Stochastic rumours. IMA. J. Appl. Math. 1, 42–55.CrossRefGoogle Scholar
Durrett, R. and Jung, P. (2007). Two phase transitions for the contact process on small worlds. Stoch. Process. Appl. 117, 1910–1927.CrossRefGoogle Scholar
Esmaeeli, N. and Sajadi, F. A. (2020). Rumour propagation among sceptics: the Markovian case. Indian J. Pure. Appl. Math. 51, 1661–1671.CrossRefGoogle Scholar
Gallo, S., Garcia, N., Junior, V. and Rodríguez, P. (2014). Rumor processes on ${\mathbb N}$ and discrete renewal processes. J. Statist. Phys. 155, 591–602.CrossRefGoogle Scholar
Gallo, S., Lerasle, M. and Takahashi, Y. D. (2013). Markov approximation of chains of infinite order in the $\bar{d}$ -metric. Markov Process. Relat. Fields 19, 51–82.Google Scholar
Garsia, A. and Lamperti, J. (1962). A discrete renewal theorem with infinite mean. Comment. Math. Helv. 37, 221–234.CrossRefGoogle Scholar
Gilbert, E. N. (1961). Random plane networks. J. Soc. Indust. Appl. Math. 22, 89–103.Google Scholar
Isham, V., Harden, S. and Nekovee, M. (2010). Stochastic epidemics and rumours on finite random networks. Physica A 389, 561–576.CrossRefGoogle Scholar
Junior, V., Machado, F. and Zuluaga, M. (2011). Rumour processes on $\mathbb N$ . J. Appl. Prob. 48, 624–636.CrossRefGoogle Scholar
Junior, V., Machado, F. and Zuluaga, M. (2014). The cone percolation on $\mathbb{T}^d$ . Brazilian J. Prob. Statist. 28, 367–675.CrossRefGoogle Scholar
Lebensztayn, E., Machado, F. P. and Rodríguez, P. M. (2011). Limit theorems for a general stochastic rumour model. SIAM J. Appl. Math. 71, 1476–1486.CrossRefGoogle Scholar
Lebensztayn, E., Machado, F. P. and Rodríguez, P. M. (2011). On the behaviour of a rumour process with random stifling. Environ. Model. Softw. 26, 517–522.CrossRefGoogle Scholar
Maki, D. P. and Thompson, M. (1973). Mathematical models and applications, with emphasis on social, life, and management sciences. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
Moreno, Y., Nekovee, M. and Pacheco, A. F. (2004). Dynamics of rumour spreading in complex networks. Phys. Rev. E 69, 066130 CrossRefGoogle Scholar
Pittel, B. (1987). On spreading a rumor. SIAM J. Appl. Math. 47, 213–223.CrossRefGoogle Scholar
Ross, S. M. (2019). Introduction to Probability Models, 12th edn. Academic Press.Google Scholar
Sajadi, F. A. and Roy, R. (2019). On rumour propagation among sceptics. J. Statist. Phys. 174, 935–952.Google Scholar
Sudbury, A. (1985). The proportion of the population never hearing a rumour. J. Appl. Prob. 22, 443–446.CrossRefGoogle Scholar