Skip to main content

A Note on Modeling Retweet Cascades on Twitter

  • Conference paper
  • First Online:
Algorithms and Models for the Web Graph (WAW 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9479))

Included in the following conference series:

Abstract

Information cascades on social networks, such as retweet cascades on Twitter, have been often viewed as an epidemiological process, with the associated notion of virality to capture popular cascades that spread across the network. The notion of structural virality (or average path length) has been posited as a measure of global spread.

In this paper, we argue that this simple epidemiological view, though analytically compelling, is not the entire story. We first show empirically that the classical SIR diffusion process on the Twitter graph, even with the best possible distribution of infectiousness parameter, cannot explain the nature of observed retweet cascades on Twitter. More specifically, rather than spreading further from the source as the SIR model would predict, many cascades that have several retweets from direct followers, die out quickly beyond that.

We show that our empirical observations can be reconciled if we take interests of users and tweets into account. In particular, we consider a model where users have multi-dimensional interests, and connect to other users based on similarity in interests. Tweets are correspondingly labeled with interests, and propagate only in the subgraph of interested users via the SIR process. In this model, interests can be either narrow or broad, with the narrowest interest corresponding to a star graph on the interested users, with the root being the source of the tweet, and the broadest interest spanning the whole graph. We show that if tweets are generated using such a mix of interests, coupled with a varying infectiousness parameter, then we can qualitatively explain our observation that cascades die out much more quickly than is predicted by the SIR model. In the same breath, this model also explains how cascades can have large size, but low “structural virality” or average path length.

H. Zhang—This work was partly done when the author was an intern at Twitter, Inc.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

    Indeed, the median of first level impressions is 175, while the median of second level impressions is 29!

  2. 2.

    A lot of spam tweets have star-like cascade structure that may significantly impact the experiment results while not representing general user behavior.

  3. 3.

    https://dev.twitter.com/streaming/public.

References

  1. Berger, N., Borgs, C., Chayes, J.T., Saberi, A.: On the spread of viruses on the internet. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 301–310. Society for Industrial and Applied Mathematics (2005)

    Google Scholar 

  2. Boguná, M., Pastor-Satorras, R., Vespignani, A.: Absence of epidemic threshold in scale-free networks with degree correlations. Phys. Rev. Lett. 90(2), 028701 (2003)

    Article  Google Scholar 

  3. Bosagh Zadeh, R., Goel, A., Munagala, K., Sharma, A.: On the precision of social and information networks. In: Proceedings of the ACM Conference on Online Social Networks (COSN), pp. 63–74 (2013)

    Google Scholar 

  4. Cheng, J., Adamic, L., Dow, P.A., Kleinberg, J.M., Leskovec, J.: Can cascades be predicted? In: Proceedings of the 23rd World Wide Web Conference (WWW), pp. 925–936 (2014)

    Google Scholar 

  5. Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York (2010)

    Book  Google Scholar 

  6. Goel, S., Anderson, A., Hofman, J., Watts, D.: The structural virality of online diffusion. Management Science (2015)

    Google Scholar 

  7. Goel, S., Watts, D.J., Goldstein, D.G.: The structure of online diffusion networks. In: Proceedings of the ACM EC, pp. 623–638 (2012)

    Google Scholar 

  8. Golub, B., Jackson, M.O.: How homophily affects diffusion and learning in networks. The Quarterly Journal of Economics (2012)

    Google Scholar 

  9. Gomez-Rodriguez, M., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. In: Proceedings of the SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), pp. 1019–1028 (2010)

    Google Scholar 

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

    Google Scholar 

  11. Kempe, D., Kleinberg, J.M., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Kleinberg, J.: Cascading behavior in networks: algorithmic and economic issues. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, pp. 613–632. Cambridge University Press, UK (2007)

    Chapter  Google Scholar 

  13. Kwak, H., Lee, C., Park, H., Moon, S.: What is twitter, a social network or a news media? In: Proceedings of the 19th International Conference on World Wide Web, pp. 591–600. ACM (2010)

    Google Scholar 

  14. Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web (TWEB) 1(1), 5 (2007)

    Article  Google Scholar 

  15. Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11, 985–1042 (2010)

    MathSciNet  MATH  Google Scholar 

  16. Leskovec, J., McGlohon, M., Faloutsos, C., Glance, N.S., Hurst, M.: Patterns of cascading behavior in large blog graphs. In: Symposium on Data Mining (SDM), vol. 7, pp. 551–556 (2007)

    Google Scholar 

  17. Mahdian, M., Xu, Y.: Stochastic Kronecker graphs. Random Struct. Algorithms 38(4), 453–466 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)

    Book  Google Scholar 

  19. Ugander, J., Backstrom, L., Marlow, C., Kleinberg, J.: Structural diversity in social contagion. Proc. Natl. Acad. Sci. (PNAS) 109(16), 5962–5966 (2012)

    Article  Google Scholar 

Download references

Acknowledgment

We are grateful to the anonymous reviewers for very helpful feedbacks. Goel and Zhang are supported by DARPA GRAPHS program via grant FA9550-12-1-0411. Munagala is supported in part by NSF grants CCF-1348696, CCF-1408784, and IIS-1447554, and by grant W911NF-14-1-0366 from the Army Research Office (ARO).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongyang Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Goel, A., Munagala, K., Sharma, A., Zhang, H. (2015). A Note on Modeling Retweet Cascades on Twitter. In: Gleich, D., Komjáthy, J., Litvak, N. (eds) Algorithms and Models for the Web Graph. WAW 2015. Lecture Notes in Computer Science(), vol 9479. Springer, Cham. https://doi.org/10.1007/978-3-319-26784-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26784-5_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26783-8

  • Online ISBN: 978-3-319-26784-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics