Effects of clustering heterogeneity on the spectral density of sparse networks
arXiv:2404.08152 · doi:10.1103/PhysRevE.110.054307
Abstract
We derive exact equations for the spectral density of sparse networks with an arbitrary distribution of the number of single edges and triangles per node. These equations enable a systematic investigation of the effect of clustering on the spectral properties of the network adjacency matrix. In the case of heterogeneous networks, we demonstrate that the spectral density becomes more symmetric as the fluctuations in the triangle-degree sequence increase. This phenomenon is explained by the small clustering coefficient of networks with a large variance of the triangle-degree distribution. In the homogeneous case of regular clustered networks, we find that both perturbative and non-perturbative approximations fail to predict the spectral density in the high-connectivity limit. This suggests that traditional large-degree approximations may be ineffective in studying the spectral properties of networks with more complex motifs. Our theoretical results are fully confirmed by numerical diagonalizations of finite adjacency matrices.
arXiv comment13 pages, 7 figures
References in corpus (30)
- The structure of scientific collaboration networks
- Epidemic processes in complex networks
- The Kuramoto model in complex networks
- Random graphs with clustering
- Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
- Graph spectra and the detectability of community structure in networks
- Spectra of complex networks
- Fundamentals of spreading processes in single and multilayer complex networks
- Random graphs containing arbitrary distributions of subgraphs
- Introduction to Random Matrices - Theory and Practice
- Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
- The robustness of interdependent clustered networks
- Message passing on networks with loops
- Cascades on a class of clustered random networks
- Spectra of random graphs with arbitrary expected degrees
- Eigenvalue Spectra of Modular Networks
- On the localization transition in symmetric random matrices
- Spectra of networks containing short loops
- Spectra of random networks with arbitrary degrees
- Higher-order structure and epidemic dynamics in clustered networks
- Spectra of sparse regular graphs with loops
- Spectra of Modular and Small-World Matrices
- Spectral density of random graphs with topological constraints
- Dynamical systems on large networks with predator-prey interactions are stable and exhibit oscillations
- The spectral density of dense random networks and the breakdown of the Wigner semicircle law
- Beyond clustering: Mean-field dynamics on networks with arbitrary subgraph composition
- Analytic solution of the resolvent equations for heterogeneous random graphs: spectral and localization properties
- Spectral Theory as Influenced by Fritz Gesztesy
- Spectra of random networks in the weak clustering regime
- Multifractality and statistical localization in highly heterogeneous random networks