Spectral properties of the hierarchical product of graphs
arXiv:1606.03930 · doi:10.1103/PhysRevE.94.052311
Abstract
The hierarchical product of two graphs represents a natural way to build a larger graph out of two smaller graphs with less regular and therefore more heterogeneous structure than the Cartesian product. Here we study the eigenvalue spectrum of the adjacency matrix of the hierarchical product of two graphs. Introducing a coupling parameter describing the relative contribution of each of the two smaller graphs, we perform an asymptotic analysis for the full spectrum of eigenvalues of the adjacency matrix of the hierarchical product. Specifically, we derive the exact limit points for each eigenvalue in the limits of small and large coupling, as well as the leading-order relaxation to these values in terms of the eigenvalues and eigenvectors of the two smaller graphs. Given its central roll in the structural and dynamical properties of networks, we study in detail the Perron-Frobenius, or largest, eigenvalue. Finally, as an example application we use our theory to predict the epidemic threshold of the Susceptible-Infected-Susceptible model on a hierarchical product of two graphs.
References in corpus (6)
- Finding community structure in networks using the eigenvectors of matrices
- Diffusion dynamics on multiplex networks
- Characterizing the dynamical importance of network nodes and links
- Pattern formation in multiplex networks
- Optimal synchronization of complex networks
- Approximating the largest eigenvalue of network adjacency matrices