Optimal modularity in complex contagion

  title={Optimal modularity in complex contagion},
  author={Azadeh Nematzadeh and Nathaniel Rodriguez and Alessandro Flammini and Yong-Yeol Ahn},
In this chapter, we apply the theoretical framework introduced in the previous chapter to study how the modular structure of the social network affects the spreading of complex contagion. In particular, we focus on the notion of optimal modularity, that predicts the occurrence of global cascades when the network exhibits just the right amount of modularity. Here we generalize the findings by assuming the presence of multiple communities and a uniform distribution of seeds across the network… 

Phase transitions in information spreading on structured populations

A framework to characterize the dynamics of the Maki–Thompson rumour spreading model in structured populations is defined, and a previously uncharacterized dynamical phase transition that separates the local and global contagion regimes is analytically found.

Antivax movement and epidemic spreading in the era of social networks: Nonmonotonic effects, bistability, and network segregation.

The results of this work hint vaccination campaigns should avoid policies that end up segregating excessively antivaccine groups so that they effectively work as echo chambers in which individuals look to confirmation without jeopardizing the safety of the whole population.

Robustness to extinction and plasticity derived from mutualistic bipartite ecological networks

It is shown that effective modularity, the ability of an ecosystem to adapt or restructure, increases with increasing numbers of extinctions, and with decreasing the replacement probability, which could be an evolutionary favored mechanism to prevent a cascade of co-extinctions.

Optimal modularity and memory capacity of neural reservoirs

It is demonstrated that there exists an optimal modularity for memory performance, where a balance between local cohesion and global connectivity is established, allowing optimally modular networks to remember longer.



Optimal network modularity for information diffusion.

The existence of an optimal network modularity is demonstrated, where global diffusion requires the minimal number of early adopters, and strong communities can facilitate global diffusion by enhancing local, intracommunity spreading.

Cascades on correlated and modular random networks.

  • J. Gleeson
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2008
An analytical approach to determining the mean avalanche size in a broad class of dynamical models on random networks is introduced. Previous results on percolation transitions and epidemic sizes are

A simple model of global cascades on random networks

  • D. Watts
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
It is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but anincreasingly heterogeneous degree distribution makes it less vulnerable.

Virality Prediction and Community Structure in Social Networks

It is demonstrated that the future popularity of a meme can be predicted by quantifying its early spreading pattern in terms of community concentration, and the more communities a meme permeates, the more viral it is.

Modularity and community structure in networks.

  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.

Community structure in social and biological networks

  • M. GirvanM. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.

Benchmark graphs for testing community detection algorithms.

This work introduces a class of benchmark graphs, that account for the heterogeneity in the distributions of node degrees and of community sizes, and uses this benchmark to test two popular methods of community detection, modularity optimization, and Potts model clustering.

Random graphs with arbitrary degree distributions and their applications.

It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.

The Spread of Behavior in an Online Social Network Experiment

Individual adoption was much more likely when participants received social reinforcement from multiple neighbors in the social network, and the behavior spread farther and faster across clustered-lattice networks than across corresponding random networks.

Organization, development and function of complex brain networks