×

A simple Markovian spreading process with mobile agents. (English) Zbl 1457.60121

Summary: We investigate a spreading process where each agent is represented by a continuous-time Markov chain with two states, \(L\) and \(M\). State \(L\) refers to “home”, whereas state \(M\) refers to a “meeting place”. When two agents stay together at \(M\), they “meet” and form a contact. This means, according to the application, that they can exchange information, infect each other, perform an act of trade, and so on. We assume that initially all are at state \(L\), and exactly one of the agents possesses a piece of information (or is infected by a contagious disease, etc.) The process can generally be classified as a spreading process with mobile agents, and its simplicity allows us to demonstrate several interesting properties. We provide an efficient way for computing the propagation time and investigate the dependence of the spreading process on parameters such as the number of agents, the number of uninformed agents at the end of the process, and the contact intensity.

MSC:

60J28 Applications of continuous-time Markov processes on discrete state spaces
91D30 Social networks; opinion dynamics

References:

[1] Centola D (2010) The spread of behavior in an online social network. Science 329(5996):1194-1197.Google Scholar
[2] Colizza V, Vespignani A (2008) Epidemic modeling in metapopulation systems with heterogeneous coupling pattern: Theory and simulations. J. Theoret. Biol. 251(3):450-467.Google Scholar · Zbl 1398.92233
[3] De Arruda GF, Rodrigues FA, Rodríguez P, Cozzo E, Moreno Y (2018) A general Markov chain approach for disease and rumour spreading in complex networks. J. Complex Networks 6(2):215-242.Google Scholar · Zbl 1460.60080
[4] Feola G, Butt A (2017) The diffusion of grassroots innovations for sustainability in Italy and Great Britain: An exploratory spatial data analysis. Geographical J. 183(1):16-33.Google Scholar
[5] Chierichetti F, Lattanzi S, Panconesi A (2011) Rumor spreading in social networks. Theoret. Comput. Sci. 412(24):2602-2610.Google Scholar · Zbl 1218.68042
[6] Gilboa-Freedman G, Hassin R (2016) When Markov chains meet: A continuous-time model of network evolution. Statist. Probability Lett. 116:131-138.Google Scholar · Zbl 1343.60114
[7] Groenevelt R, Nain P, Koole G (2005) The message delay in mobile ad hoc networks. Performance Evaluation 62:210-228.Google Scholar
[8] Isella L, Stehlé J, Barrat A, Cattuto C, Pinton J-F (2011) What’s in a crowd? Analysis of face-to-face behavioral networks. J. Theoret. Biol. 271(1):166-180.Google Scholar · Zbl 1405.92255
[9] Jin M, Liu F, Zhou C (2017) Rumor spreading: A survey. 2nd Internat. Conf. Artificial Intelligence Engrg. Appl. (AIEA 2017), 263-269.Google Scholar
[10] Manzo G, Gabbriellin S, Roux V, M’Mbogori FN (2018) Complex contagions and the diffusion of innovations: evidence from a small-N study. J. Archaeological Method Theory 25(4):1109-1154.Google Scholar
[11] Mascia MB, Mills M (2018) When conservation goes viral: The diffusion of innovative biodiversity conservation policies and practices. Conservation Lett. 11(3):e12442, https://doi.org/10.1111/conl.12442.Google Scholar
[12] Milling C, Caramanis C, Mannor S, Shakkottai S (2015) Distinguishing infections on different graph topologies. IEEE Trans. Inform. Theory 61(6):3100-3120.Google Scholar · Zbl 1359.94965
[13] Nowzari C, Preciado VM, Pappas GJ (2016) Analysis and control of epidemics. IEEE Control Systems Magazine 36(1):26-46.Google Scholar · Zbl 1476.92046
[14] Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev. Modern Phys. 87(3):925-979.Google Scholar
[15] Rogers EM (1995) Diffusion of Innovations, 4th ed. (Free Press, New York).Google Scholar
[16] Sattenspiel L, Dietz K (1995) A structured epidemic model incorporating geographic mobility among regions. Math. Biosciences 128(1-2):71-91.Google Scholar · Zbl 0833.92020
[17] Simpson G, Clifton J (2017) Testing diffusion of innovations theory with data: Financial incentives, early adopters, and distributed solar energy in Australia. Energy Res. Soc. Sci. 29:12-22.Google Scholar
[18] Sun H, Cheng R, Xiao X, Yan J, Zheng Y, Qian Y (2018) Maximizing social influence for the awareness threshold model. Pei J, Manolopoulos Y, Sadiq S, Li J, eds. Database Systems for Advanced Applications, Lecture Notes in Computer Science, vol. 10827 (Springer, Cham), 491-510.Google Scholar
[19] Vespignani A (2012) Modelling dynamical processes in complex socio-technical systems. Nature Phys. 8:32-39.Google Scholar
[20] Xiong H, Wang P, Bobashev G (2018) Multiple peer effects in the diffusion of innovations on social networks: a simulation study. J. Innovation Entrepreneurship 7(1):1-18.Google Scholar
[21] Zhang X, Neglia G, Kurose J, Towsley D (2007) Performance modeling of epidemic routing. Comput. Networks 51(10):2867-2891.Google Scholar · Zbl 1120.68029
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.