Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

A process of rumour scotching on finite populations

Texto completo
Autor(es):
de Arruda, Guilherme Ferraz [1] ; Lebensztayn, Elcio [2] ; Rodrigues, Francisco A. [1] ; Rodriguez, Pablo Martin [1]
Número total de Autores: 4
Afiliação do(s) autor(es):
[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
Número total de Afiliações: 2
Tipo de documento: Artigo Científico
Fonte: ROYAL SOCIETY OPEN SCIENCE; v. 2, n. 9 SEP 2015.
Citações Web of Science: 3
Resumo

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)

Processo FAPESP: 13/26416-9 - Modelagem de processos dinâmicos em redes complexas
Beneficiário:Francisco Aparecido Rodrigues
Linha de fomento: Auxílio à Pesquisa - Regular
Processo FAPESP: 13/03898-8 - Modelagem estocástica da difusão de uma informação em sistemas interagentes
Beneficiário:Pablo Martin Rodriguez
Linha de fomento: Auxílio à Pesquisa - Regular
Processo FAPESP: 11/50761-2 - Modelos e métodos de e-Science para ciências da vida e agrárias
Beneficiário:Roberto Marcondes Cesar Junior
Linha de fomento: Auxílio à Pesquisa - Temático
Processo FAPESP: 12/25219-2 - Modelagem, análise e simulação de processos dinâmicos em redes complexas
Beneficiário:Guilherme Ferraz de Arruda
Linha de fomento: Bolsas no Brasil - Doutorado
Processo FAPESP: 12/22673-4 - Modelos estocásticos para a propagação de rumores e epidemias
Beneficiário:Élcio Lebensztayn
Linha de fomento: Auxílio à Pesquisa - Regular