Skip to main content

Modeling Memetics Using Edge Diversity

  • Chapter
  • First Online:
Complex Networks VII

Part of the book series: Studies in Computational Intelligence ((SCI,volume 644))

Abstract

The study of meme propagation and the prediction of meme trajectory are emerging areas of interest in the field of complex networks research. In addition to the properties of the meme itself, the structural properties of the underlying network decides the speed and the trajectory of the propagating meme. In this paper, we provide an artificial framework for studying the meme propagation patterns. Firstly, the framework includes a synthetic network which simulates a real world network and acts as a testbed for meme simulation. Secondly, we propose a meme spreading model based on the diversity of edges in the network. Through the experiments conducted, we show that the generated synthetic network combined with the proposed spreading model is able to simulate a real world meme spread. Our proposed model is validated by the propagation of the Higgs boson meme on Twitter as well as many real world social networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The work shows that scale free networks possess a core-periphery structure. They define cp-centralisation value which is a measure of the degree to which a network contains a core-periphery structure. According to this study, the average cp-centralisation value for 1000 instances of scale free networks with 100 nodes and average degree 4 is 0.668.

  2. 2.

    Homophily is the name given to the tendency of similar people becoming friends with each other. This leads to more number of ties between like minded people and hence leads to the formation of communities in the network. Social reinforcement is the phenomenon by which multiple exposures of an information to a person leads to him adopting it. Social reinforcement and homophily tend to block the information inside one community.

  3. 3.

    In the case of random network, even though the declared 10 % core nodes have a high probability of infecting their neighbours, the connections between the core nodes are not dense enough to result in an overshoot in the number of infected nodes.

References

  1. Clissold, B.D.: Candid camera and the origins of reality tv. In: Understanding Reality Television, pp. 33–53 (2004)

    Google Scholar 

  2. Christakis, N.A., Fowler, J.H.: The spread of obesity in a large social network over 32 years. New Engl. J. Med. 357(4), 370–379 (2007)

    Article  Google Scholar 

  3. S.N. Statistics.: Statistic Brain (July 9, 2014)

    Google Scholar 

  4. Daley, D.J., Kendall, D.G.: Epidemics and rumours. Nature 204, 1118 (1964)

    Article  Google Scholar 

  5. Hethcote, H.W.: Three basic epidemiological models. In: Applied Mathematical Ecology. Springer, Berlin (1989), pp. 119–144

    Google Scholar 

  6. Goldenberg, J., Libai, B., Muller, E.: Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark. Lett. 12(3), 211–223 (2001)

    Article  Google Scholar 

  7. Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol., 1420–1443 (1978)

    Google Scholar 

  8. Bakshy, E., Rosenn, I., Marlow, C., Adamic, L.: The role of social networks in information diffusion. In: Proceedings of the 21st International Conference on World Wide Web. ACM (2012), pp. 519–528

    Google Scholar 

  9. Lerman, K., Ghosh, R.: Information contagion: an empirical study of the spread of news on digg and twitter social networks. ICWSM 10, 90–97 (2010)

    Google Scholar 

  10. Kleinberg, J.: Cascading behavior in networks: algorithmic and economic issues. Algorithmic Game Theory 24, 613–632 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Saito, K., Nakano, R., Kimura, M.: Prediction of information diffusion probabilities for independent cascade model. In: Knowledge-Based Intelligent Information and Engineering Systems. Springer, New York (2008), pp. 67–75

    Google Scholar 

  12. Pastor-Satorras, R., Vespignani, A.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86(14), 3200 (2001)

    Article  Google Scholar 

  13. Zhang, Z.Y.-C.L.Y., Fei, H.-F.C.H.X.: The research of information dissemination model on online social network. Acta Phys. Sinica 5, 10 (2011)

    Google Scholar 

  14. Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web. ACM (2011), pp. 665–674

    Google Scholar 

  15. Scanfeld, D., Scanfeld, V., Larson, E.L.: Dissemination of health information through social networks: twitter and antibiotics. Am. J. infect. Control 38(3), 182–188 (2010)

    Article  Google Scholar 

  16. Guerini, M., Strapparava, C., Özbal, G.: Exploring text virality in social networks. In: ICWSM (2011)

    Google Scholar 

  17. Weng, L., Menczer, F., Ahn, Y.-Y.: Virality prediction and community structure in social networks. Sci. Rep. 3 (2013)

    Google Scholar 

  18. Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Automata, Languages and Programming. Springer, Heidelberg (2005), pp. 1127–1138

    Google Scholar 

  19. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM (2003), pp. 137–146

    Google Scholar 

  20. Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E., Makse, H.A.: Identification of influential spreaders in complex networks. Nature Phys. 6(11), 888–893 (2010)

    Article  Google Scholar 

  21. Wu, J.-J., Gao, Z.-Y., Sun, H.-J.: Cascade and breakdown in scale-free networks with community structure. Phys. Rev. E 74(6), 066111 (2006)

    Article  Google Scholar 

  22. Saxena, A., Iyengar, S., Gupta, Y.: Understanding spreading patterns on social networks based on network topology (2015). arXiv:1505.00457

  23. Della Rossa, F., Dercole, F., Piccardi, C.: Profiling core-periphery network structure by random walkers. Sci. Rep. 3 (2013)

    Google Scholar 

  24. McPherson, M., Smith-Lovin, L., Cook, J.M.: Birds of a feather: homophily in social networks. Annu. Rev. Sociol., 415–444 (2001)

    Google Scholar 

  25. Granovetter, M.S.: The strength of weak ties. Am. J. Sociol., 1360–1380 (1973)

    Google Scholar 

  26. De Domenico, M., Lima, A., Mougel, P., Musolesi, M.: The anatomy of a scientific rumor. Sci. Rep. 3 (2013)

    Google Scholar 

  27. Yang, Z., Guo, J., Cai, K., Tang, J., Li, J., Zhang, L., Su, Z.: Understanding retweeting behaviors in social networks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management. ACM (2010), pp. 1633–1636

    Google Scholar 

  28. Leskovec, J., Mcauley, J.J.: Learning to discover social circles in ego networks. In: Advances in Neural Information Processing Systems (2012), pp. 539–547

    Google Scholar 

  29. Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066111 (2004)

    Article  Google Scholar 

Download references

Acknowledgments

S.R.S. Iyengar was partially supported by the ISIRD grant(Ref. No. IITRPR/Acad./359) from IIT Ropar. Further, we express our gratitude to the Indian Academy of Sciences,Bangalore for providing us with partial funding to carry out this research.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yayati Gupta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Gupta, Y., Saxena, A., Das, D., Iyengar, S.R.S. (2016). Modeling Memetics Using Edge Diversity. In: Cherifi, H., Gonçalves, B., Menezes, R., Sinatra, R. (eds) Complex Networks VII. Studies in Computational Intelligence, vol 644. Springer, Cham. https://doi.org/10.1007/978-3-319-30569-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30569-1_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30568-4

  • Online ISBN: 978-3-319-30569-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics