Phase Transition for the Maki–Thompson Rumour Model on a Small-World Network
Language
English
Status
Published
JCR Journal
JCR Journal
Issue/vol(year)
/169 (2017)
ISSN
0022-4715
Publisher
Springer-Nature
Pages (printed)
846–875
Date Issued
October 14, 2017
Abstract
WeconsidertheMaki–Thompsonmodelforthestochasticpropagationofarumour within a population. In this model the population is made up of “spreaders”, “ignorants” and “stiflers”; any spreader attempts to pass the rumour to the other individuals via pair-wise interactions and in case the other individual is an ignorant, it becomes a spreader, while in the other two cases the initiating spreader turns into a stifler. In a finite population the process will eventually reach an equilibrium situation where individuals are either stiflers or ignorants. We extend the original hypothesis of homogenously mixed population by allowing for a small-world network embedding the model, in such a way that interactions occur only between nearest-neighbours. This structure is realized starting from a k-regular ring and by inserting, in the average, c additional links in such a way that k and c are tuneable parameters for the population architecture. We prove that this system exhibits a transition between regimes of localization (where the final number of stiflers is at most logarithmic in the population size) and propagation (where the final number of stiflers grows algebraically with the population size) at a finite value of the network parameter c. A quantitative estimate for the critical value of c is obtained via extensive numerical simulations.
Type
article
File(s)![]()
Name
Pubblicazione2_jsp_Tavani.pdf
Description
Restricted file
Size
814.01 KB
Format
Adobe PDF
Checksum (MD5)
The MD5 message-digest algorithm can be used to verify the integrity of the file that you have uploaded. You can calculate its value locally via tools that are generally available in each operative system like md5sum
eeefc15d0002cd53c2c5869b69719b83
