Degree-targeted cascades in modular, degree-heterogeneous networks
arXiv:2004.09316 · doi:10.1103/PhysRevResearch.4.013040
Abstract
The dynamics of cascading activation, such as rapid changes in public opinion and the outbreak of disease epidemics, have a crucial dependence on the connectivity patterns among the agents. We study cascading dynamics in modular, degree-heterogeneous networks, and consider the impact of intra-module seeding strategy on inter-module spread. Specifically, we establish that although activating the highest-degree nodes is more effective than random selection at growing a cascade locally, there is a critical level of inter-module connectivity required for a cascade to cross from one module to another, irrespective of the seeding strategy. We present an analytical proof of this statement for the case that each module has the same degree distribution and all module pairs have the same inter-module connectivity, while our simulation results suggest its validity for more general situations, including a ring of modules. Interestingly, we find that on a network comprised of two modules, this critical level is primarily determined by the degree distribution of the \emph{alter} module, as opposed to the seed module. Our analytical approach extends a method developed by Gleeson, but is able to capture different seeding strategies using only one dynamical variable per module, namely the conditional exposure probability. Our work shows that the possibility of a global cascade depends sensitively on inter-module connectivity, and less on the intra-module seeding strategy. This suggests, for example, that slight changes to inter-module connectivity can be a feasible intervention strategy to promote or inhibit global cascades.
References in corpus (20)
- The structure and function of complex networks
- Error and attack tolerance of complex networks
- Epidemic spreading in scale-free networks
- Mixing patterns in networks
- Benchmark graphs for testing community detection algorithms
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Stochastic blockmodels and community structure in networks
- Breakdown of the Internet under intentional attack
- Influence maximization in complex networks through optimal percolation
- Cascade control and defense in complex networks
- Suppressing cascades of load in interdependent networks
- Realistic Control of Network Dynamics
- Why Nestedness in Mutualistic Networks?
- Optimal network modularity for information diffusion
- The unreasonable effectiveness of tree-based theory for networks with clustering
- Branching Dynamics of Viral Information Spreading
- Rescuing ecosystems from extinction cascades through compensatory perturbations
- Factors determining nestedness in complex networks
- Cascading failures in scale-free interdependent networks