Cooperative and competitive dynamics model for information propagation in online social networks. (English) Zbl 1442.91077

J. Appl. Math. 2014, Article ID 610382, 12 p. (2014); corrigendum ibid. 2022, Article ID 9840796, 1 p. (2022).
Summary: Traditional empirical models of propagation consider individual contagion as an independent process, thus spreading in isolation manner. In this paper, we study how different contagions interact with each other as they spread through the network in order to propose an alternative dynamics model for information propagation. The proposed model is a novel combination of Lotka-Volterra cooperative model and competitive model. It is assumed that the interaction of one message on another is flexible instead of always negative. We prove that the impact of competition depends on the critical speed of the messages. By analyzing the differential equations, one or two stable equilibrium points can be found under certain conditions. Simulation results not only show the correctness of our theoretical analyses but also provide a more attractive conclusion. Different types of messages could coexist in the condition of high critical speed and intense competitive environment, or vice versa. The messages will benefit from the high critical speed when they are both competitive, and adopting a Tit-for-Tat strategy is necessary during the process of information propagation.


91D30 Social networks; opinion dynamics
Full Text: DOI


[1] Wu, W. W., The cooperation-competition model for the hot topics of Chinese microblogs, Applied Mechanics and Materials, 380-384, 2724-2727 (2013)
[2] Bosley, J. C.; Zhao, N. W.; Hill, S.; Shofer, F. S.; Asch, D. A.; Becker, L. B.; Merchant, R. M., Decoding twitter: Surveillance and trends for cardiac arrest and resuscitation communication, Resuscitation, 84, 2, 206-212 (2013)
[3] Weigang, L.; Sandes, E. F. O.; Zheng, J.; Melo, A. C. M. A.; Uden, L., Querying dynamic communities in online social networks, Journal of Zhejiang University Science C, 15, 2, 81-90 (2014)
[4] Zhao, X.; Wang, J., Dynamical model about rumor spreading with medium, Discrete Dynamics in Nature and Society, 2013 (2013) · Zbl 1264.91109
[5] Daley, D. J.; Kendall, D. G., Epidemics and Rumours [49], Nature, 204, 4963, 1118 (1964)
[6] Daley, D. J.; Kendall, D. G., Stochastic rumours, Journal of the Institute of Mathematics and Its Applications, 1, 42-55 (1965)
[7] Maki, D. P.; Thompson, M., Mathematical Models and Applications: With Emphasis on the Social, Life, and Management Sciences (1973), Englewood Cliffs, NJ, USA: Prentice Hall, Englewood Cliffs, NJ, USA
[8] Piqueira, J. R. C., Rumor propagation model: an equilibrium study, Mathematical Problems in Engineering, 2010 (2010) · Zbl 1189.92083
[9] Zanette, D. H., Dynamics of rumor propagation on small-world networks, Physical Review E, 65, 4 (2002)
[10] Moreno, Y.; Nekovee, M.; Vespignani, A., Efficiency and reliability of epidemic data dissemination in complex networks, Physical Review E, 69 (2004)
[11] Moreno, Y.; Nekovee, M.; Pacheco, A. F., Dynamics of rumor spreading in complex networks, Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, 69, 6 (2004)
[12] Zhou, J.; Liu, Z.; Li, B., Influence of network structure on rumor propagation, Physics Letters A, 368, 6, 458-463 (2007)
[13] Nekovee, M.; Moreno, Y.; Bianconi, G.; Marsili, M., Theory of rumour spreading in complex social networks, Physica A, 374, 1, 457-470 (2007)
[14] Granovetter, M., Threshold models of collective behavior, The American Journal of Sociology, 1420-1443 (1978)
[15] Kempe, D.; Kleinberg, J.; Tardos, É., Maximizing the spread of influence through a social network, Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’03)
[16] Trpevski, D.; Tang, W. K. S.; Kocarev, L., Model for rumor spreading over networks, Physical Review E, 81, 5 (2010)
[17] Liu, Z. Z.; Xing-Yuan, W.; Mao-Ji, W., Competition between two kinds of information among random-walking individuals, Chinese Physics B, 21, 4 (2012)
[18] Wei, X. T.; Valler, N.; Prakash, B. A.; Neamtiu, I.; Faloutsos, M.; Faloutsos, C., Competing memes propagation on networks: a case study of composite networks, ACM SIGCOMM Computer Communication Review, 42, 5, 5-12 (2012)
[19] Wang, Y. B.; Xiao, G. X.; Liu, J., Dynamics of competing ideas in complex social systems, New Journal of Physics, 14, 1 (2012)
[20] Weng, L.; Flammini, A.; Vespignani, A.; Menczer, F., Competition among memes in a world with limited attention, Scientific Reports, 2, article 335 (2012)
[21] Myers, S. A.; Leskovec, J., Clash of the contagions: cooperation and competition in information diffusion, Proceedings of the 12th IEEE International Conference on Data Mining (ICDM ’12)
[22] Lü, L.; Chen, D.; Zhou, T., The small world yields the most effective information spreading, New Journal of Physics, 13 (2011)
[23] Hernandez, M. J.; Barradas, I., Variation in the outcome of population interactions: bifurcations and catastrophes, Journal of Mathematical Biology, 46, 6, 571-594 (2003) · Zbl 1023.92033
[24] Zhang, Z., Mutualism or cooperation among competitors promotes coexistence and competitive ability, Ecological Modelling, 164, 2-3, 271-282 (2003)
[25] Hofbauer, J.; Sigmund, K., Evolutionary Games and Population Dynamics (1998), Cambridge, UK: Cambridge University Press, Cambridge, UK · Zbl 0914.90287
[26] Zhang, Z.; Ding, T.; Huang, W.; Dong, Z., Qualitative Theory of Differential Equations. Qualitative Theory of Differential Equations, Translations of Mathematical Monographs, 101 (1992), Providence, RI, USA: AMS, Providence, RI, USA
[27] Ren, D.; Zhang, X.; Wang, Z.; Li, J.; Yuan, X., WeiboEvents: a crowd sourcing weibo visual analytic system, Proceedings of the IEEE Pacific Visualization Symposium (PacificVis ’14)
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.