Skip to main content

Activation Cascades in Structured Populations

  • Chapter
  • First Online:
Handbook of Human Computation
  • 3273 Accesses

Abstract

Most real-world networks have a modular structure, i.e., they are composed of clusters of well connected nodes, with relatively lower density of links across different clusters. Here we report on our studies of a simple cascading process in a structured heterogeneous population composed of two loosely coupled communities. We demonstrate that under certain conditions the cascading dynamics in such a network has a two-tiered structure that characterizes activity spreading at different rates in the communities. We also demonstrate that the structure has implication on problems such as influence maximization. In particular, it is shown that targeting heuristics that work provably well for homogenous networks can produce significantly sub-optimal results for heterogenous networks. We suggest a simple modification of the heuristics that accounts for the community structure, and observe improved performance.

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.

    Furthermore, we would like to argue that the modified model with integer threshold also seems more plausible from the social-choice standpoint. Indeed, it is hard to imagine that, when trying to make a decision based on our friends’ recommendations, we normalize the number of recommendations by the total number of our friends.

  2. 2.

    Θ(x) = 1 if x ≥ 0, and Θ(x) = 0 otherwise.

  3. 3.

    Strictly speaking, P(k; t) is given by a binomial distribution B(N 0, p). However, in the limit of large network sizes considered here, we approximate the binomial distribution by the Poisson distribution as it simplifies the analysis.

  4. 4.

    Due to space restrictions, here we report our findings only for the integer threshold model on synthetic graphs.

References

  • Arenas A, Diiaz-Guilera A, Peerez-Vicente CJ (2006) Synchronization reveals topological scales in complex networks. Phys Rev Lett 96:114102

    Article  Google Scholar 

  • Borge-Holthoefer J, Baos RA, Gonzlez-Bailn S, Moreno Y (2013) Cascading behaviour in complex socio-technical networks. J Complex Networks 1(1):3–24

    Google Scholar 

  • Bruyn AD, Lilien GL (2008) A multi-stage model of word-of-mouth influence through viral marketing. Int J Res Mark 25(3):151–163

    Article  Google Scholar 

  • Derrida B, Pomeau Y (1986) Random networks of automata: a simple annealed approximation. Europhys Lett (EPL) 1(2):45–49

    Article  Google Scholar 

  • Derrida B, Stauffer D (1986) Phase transitions in two-dimensional kauffman cellular automata. Europhys Lett (EPL) 2(10):739–745

    Article  Google Scholar 

  • Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD’01: proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco. ACM, New York, pp 57–66

    Google Scholar 

  • Fortunato S (2010) Community detection in graphs. Phys Rep 486(35):75–174

    Article  MathSciNet  Google Scholar 

  • Galstyan A, Cohen P (2007) Cascading dynamics in modular networks. Phys Rev E 75:036109

    Article  Google Scholar 

  • Galstyan A, Musoyan V, Cohen P (2009) Maximizing influence propagation in networks with community structure. Phys Rev E 79:056102

    Article  Google Scholar 

  • Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826

    Article  MathSciNet  MATH  Google Scholar 

  • Gleeson JP (2008) Cascades on correlated and modular random networks. Phys Rev E 77:046117

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Gupta S, Anderson RM, May RM (1989) Networks of sexual contacts: implications for the pattern of spread of HIV. AIDS 3:807–817

    Article  Google Scholar 

  • Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Soc Netw 5(2):109–137

    Article  MathSciNet  Google Scholar 

  • Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: KDD’03: proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, New York, NY, USA, ACM, pp 137–146

    Google Scholar 

  • Kempe D, Kleinberg J, Tardos E (2005) Influential nodes in a diffusion model for social networks. In: Proceedings of 32nd international colloquium on automata, languages and programming (ICALP), Springer-Verlag, Berlin, Heidelberg

    Google Scholar 

  • Krackhardt D (1997) Organizational viscosity and the diffusion of controversial innovations. J Math Sociol 22(2):177–199

    Article  MATH  Google Scholar 

  • McGrath C, Krackhardt D (2003) Network conditions for organizational change. J Appl Behav Sci 39(3):324–336

    Article  Google Scholar 

  • Melnik S, Porter MA, Mucha PJ, Gleeson JP (2012) Dynamics on modular networks with heterogeneous correlations. CoRR abs/1207.1809

    Google Scholar 

  • Melnik S, Ward JA, Gleeson JP, Porter MA (2013) Multi-stage complex contagions. Chaos Interdiscip J Nonlinear Sci 23(1):013124

    Article  Google Scholar 

  • Mossel E, Roch S (2007) On the submodularity of influence in social networks. In: STOC’07: proceedings of the 39th annual ACM symposium on theory of computing, San Diego. ACM, New York, pp 128–134

    Google Scholar 

  • Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103(23):8577–8582

    Article  Google Scholar 

  • Payne JL, Dodds PS, Eppstein MJ (2009) Information cascades on degree-correlated random networks. Phys Rev E 80:026125

    Article  Google Scholar 

  • Piedrahita P, Borge-Holthoefer J, Moreno Y, Arenas A (2013) Modeling self-sustained activity cascades in socio-technical networks. arXiv:1305.4299

    Google Scholar 

  • Rohlf T, Bornholdt S (2002) Criticality in random threshold networks: annealed approximation and beyond. Physica A 310(1):245–259

    Article  MATH  Google Scholar 

  • Watts D (2004) A simple model of global cascades on random networks. Proc Natl Acad Sci USA 99:5766

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aram Galstyan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Galstyan, A. (2013). Activation Cascades in Structured Populations. In: Michelucci, P. (eds) Handbook of Human Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8806-4_63

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-8806-4_63

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-8805-7

  • Online ISBN: 978-1-4614-8806-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics