Epidemic spreading on complex networks with community structures
arXiv:1611.06092 · doi:10.1038/srep29748
Abstract
Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees. These models show that community structure is an important determinant of the behavior of percolation processes on networks, such as information diffusion or virus spreading: the community structure can both \textit{enforce} as well as \textit{inhibit} diffusion processes. Our models further show that it is the mesoscopic set of communities that matters. The exact internal structures of communities barely influence the behavior of percolation processes across networks. This insensitivity is likely due to the relative denseness of the communities.
19 pages
References in corpus (12)
- Power-law distributions in empirical data
- Maps of random walks on complex networks reveal community structure
- Benchmark graphs for testing community detection algorithms
- Critical phenomena in complex networks
- Structure and tie strengths in mobile communication networks
- On the uniform generation of random graphs with prescribed degree sequences
- Characterizing the community structure of complex networks
- Percolation and Epidemic Thresholds in Clustered Networks
- Clustering in complex networks. II. Percolation properties
- Collective synchronization induced by epidemic dynamics on complex networks with communities
- Bond percolation on a class of clustered random networks
- Empirical Comparison of Algorithms for Network Community Detection