Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A process of rumour scotching on finite populations

Full text
Author(s):
de Arruda, Guilherme Ferraz [1] ; Lebensztayn, Elcio [2] ; Rodrigues, Francisco A. [1] ; Rodriguez, Pablo Martin [1]
Total Authors: 4
Affiliation:
[1] Univ Sao Paulo, Dept Matemat Aplicada & Estat, Inst Ciencias Matemat & Comp, Campus Sao Carlos, Caixa Postal 668, BR-13560970 Sao Carlos, SP - Brazil
[2] Univ Estadual Campinas, Inst Matemat Estat & Comp Cient, UNICAMP, BR-13083859 Campinas, SP - Brazil
Total Affiliations: 2
Document type: Journal article
Source: ROYAL SOCIETY OPEN SCIENCE; v. 2, n. 9 SEP 2015.
Web of Science Citations: 2
Abstract

Rumour spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumour is propagated by pairwise interactions between spreaders and ignorants. Only spreaders are active and may become stiflers after contacting spreaders or stiflers. Here we propose a competition-like model in which spreaders try to transmit an information, while stiflers are also active and try to scotch it. We study the influence of transmission/scotching rates and initial conditions on the qualitative behaviour of the process. An analytical treatment based on the theory of convergence of density-dependentMarkov chains is developed to analyse how the final proportion of ignorants behaves asymptotically in a finite homogeneously mixing population. We perform Monte Carlo simulations in random graphs and scale-free networks and verify that the results obtained for homogeneously mixing populations can be approximated for random graphs, but are not suitable for scale-free networks. Furthermore, regarding the process on a heterogeneous mixing population, we obtain a set of differential equations that describes the time evolution of the probability that an individual is in each state. Our model can also be applied for studying systems in which informed agents try to stop the rumour propagation, or for describing related susceptibleinfected- recovered systems. In addition, our results can be considered to develop optimal information dissemination strategies and approaches to control rumour propagation. (AU)

FAPESP's process: 12/25219-2 - Modeling, analysis and simulation of dynamic process on complex networks
Grantee:Guilherme Ferraz de Arruda
Support type: Scholarships in Brazil - Doctorate
FAPESP's process: 11/50761-2 - Models and methods of e-Science for life and agricultural sciences
Grantee:Roberto Marcondes Cesar Junior
Support type: Research Projects - Thematic Grants
FAPESP's process: 13/03898-8 - Stochastic modeling of information difusion on interacting systems
Grantee:Pablo Martin Rodriguez
Support type: Regular Research Grants
FAPESP's process: 13/26416-9 - Modelling of dynamical processes in complex networks
Grantee:Francisco Aparecido Rodrigues
Support type: Regular Research Grants
FAPESP's process: 12/22673-4 - Stochastic models for the spreading of rumours and epidemics
Grantee:Elcio Lebensztayn
Support type: Regular Research Grants