Skip to main content
SpringerLink
Log in

Diffusion of Innovations on Random Networks: Understanding the Chasm

  • Conference paper
Internet and Network Economics (WINE 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5385))

Included in the following conference series:

Abstract

We analyze diffusion models on sparse random networks with neighborhood effects. We show how large cascades can be triggered by small initial shocks and compute critical parameters: contagion threshold for a random network, phase transition in the size of the cascade.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balogh, J., Pittel, B.G.: Bootstrap percolation on the random regular graph. Random Structures Algorithms 30(1-2), 257–286 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bollobás, B.: Random graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol. 73. Cambridge University Press, Cambridge (2001)

    Book  MATH  Google Scholar 

  3. Chen, N.: On the approximability of influence in social networks. In: SODA 2008 (2008)

    Google Scholar 

  4. Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD 2001 (2001)

    Google Scholar 

  5. Janson, S.: The probability that a random multigraph is simple, arxiv.org:math/0609802 (2006)

    Google Scholar 

  6. Janson, S.: On percolation in random graphs with given vertex degrees, arxiv.org:0804.1656 (2008)

    Google Scholar 

  7. Janson, S., Luczak, M.J.: A simple solution to the k-core problem. Random Structures Algorithms 30(1-2), 50–62 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD 2003 (2003)

    Google Scholar 

  9. Kleinberg, J.: Cascading behavior in networks: Algorithmic and economic issues. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)

    Google Scholar 

  10. Lelarge, M.: Diffusion and cascading behavior in random networks (in preparation)

    Google Scholar 

  11. Molloy, M., Reed, B.: A critical point for random graphs with a given degree sequence. Random Structures Algorithms 6(2-3), 161–179 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  12. Moore, G.: Crossing the Chasm. HarperBusiness, New York (2002)

    Google Scholar 

  13. Morris, S.: Contagion. Rev. Econom. Stud. 67(1), 57–78 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Newman, M.E.J.: Spread of epidemic disease on networks. Phys. Rev. E 66(1), 016128 (2002)

    Article  MathSciNet  Google Scholar 

  15. Pastor-Satorras, R., Vespignani, A.: Evolution and Structure of the Internet: A Statistical Physics Approach. Cambridge University Press, New York (2004)

    Book  MATH  Google Scholar 

  16. Rogers, E.M.: Diffusion of Innovations, 5th edn. Free Press (August 2003)

    Google Scholar 

  17. Vega-Redondo, F.: Complex Social Networks. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  18. Watts, D.J.: A simple model of global cascades on random networks. Proc. Natl. Acad. Sci. USA 99(9), 5766–5771 (2002) (electronic)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-ENS, Paris, France

    Marc Lelarge

Authors
  1. Marc Lelarge
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Division, University of California at Berkeley, Berkeley, CA, USA

    Christos Papadimitriou

  2. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

    Shuzhong Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lelarge, M. (2008). Diffusion of Innovations on Random Networks: Understanding the Chasm. In: Papadimitriou, C., Zhang, S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92185-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92185-1_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92184-4

  • Online ISBN: 978-3-540-92185-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation