Spectra of random networks in the weak clustering regime
arXiv:1310.3389 · doi:10.1209/0295-5075/121/68001
Abstract
The asymptotic behaviour of dynamical processes in networks can be expressed as a function of spectral properties of the corresponding adjacency and Laplacian matrices. Although many theoretical results are known for the spectra of traditional configuration models, networks generated through these models fail to describe many topological features of real-world networks, in particular non-null values of the clustering coefficient. Here we study effects of cycles of order three (triangles) in network spectra. By using recent advances in random matrix theory, we determine the spectral distribution of the network adjacency matrix as a function of the average number of triangles attached to each node for networks without modular structure and degree-degree correlations. Implications to network dynamics are discussed. Our findings can shed light in the study of how particular kinds of subgraphs influence network dynamics.
References in corpus (13)
- Epidemic processes in complex networks
- Synchronization in complex networks
- The Kuramoto model in complex networks
- Random graphs with clustering
- Random graphs containing arbitrary distributions of subgraphs
- The robustness of interdependent clustered networks
- Clustering in complex networks. II. Percolation properties
- Performance of networks of artificial neurons: The role of clustering
- Bond percolation on a class of clustered random networks
- Spectra of random graphs with arbitrary expected degrees
- Eigenvalue Spectra of Modular Networks
- Hopping on the Bethe lattice: Exact results for densities of states and dynamical mean-field theory
- Ising model in clustered scale-free networks