Unifying Markov Chain Approach for Disease and Rumor Spreading in Complex Networks
نویسندگان
چکیده
Guilherme Ferraz de Arruda,1 Francisco A. Rodrigues,1, ∗ Pablo Martín Rodríguez,1 Emanuele Cozzo,2, 3 and Yamir Moreno2, 3, 4, † Departamento de Matemática Aplicada e Estatística, Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo Campus de São Carlos, Caixa Postal 668, 13560-970 São Carlos, SP, Brazil. Institute for Biocomputation and Physics of Complex Systems (BIFI), University of Zaragoza, 50018 Zaragoza, Spain Department of Theoretical Physics, University of Zaragoza, 50018 Zaragoza, Spain Complex Networks and Systems Lagrange Lab, Institute for Scientific Interchange, Turin, Italy
منابع مشابه
Modeling and Analyzing the Interaction between Network Rumors and Authoritative Information
In this paper, we propose a novel two-stage rumor spreading SusceptibleInfected-Authoritative-Removed (SIAR) model for complex homogeneous and heterogeneous networks. The interaction Markov chains (IMC) mean-field equations based on the SIAR model are derived to describe the dynamic interaction between the rumors and authoritative information. We use a Monte Carlo simulation method to character...
متن کاملA computational model and convergence theorem for rumor dissemination in social networks
The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...
متن کاملGossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading | Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network, and every node is only allowed to call one neighbor in each round. In this work we introduce two fundamentally new techniques in studying the rumor spreading problem: First, we establish a new connection between the rumor spreading process in an arbitrary graph a...
متن کاملGossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph G with n nodes such that, the protocol informs every node in O(log n) rounds with high probability, and uses Õ(log n) random bits in total. The runtime of our protocol is tight, and the randomness requirement o...
متن کاملDynamics of rumor spreading in complex networks.
We derive the mean-field equations characterizing the dynamics of a rumor process that takes place on top of complex heterogeneous networks. These equations are solved numerically by means of a stochastic approach. First, we present analytical and Monte Carlo calculations for homogeneous networks and compare the results with those obtained by the numerical method. Then, we study the spreading p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1609.00682 شماره
صفحات -
تاریخ انتشار 2016