Eigenvector localization in hypergraphs: pair-wise vs higher-order links
arXiv:2207.12785 · doi:10.1103/PhysRevE.107.034311
Abstract
Localization behaviours of Laplacian eigenvectors of complex networks provide understanding to various dynamical phenomena on the corresponding complex systems. We numerically investigate role of hyperedges in driving eigenvector localization of hypergraphs Laplacians. By defining a single parameter γwhich measures the relative strengths of pair-wise and higher-order interactions, we analyze the impact of interactions on localization properties. For, γ< 1 there exists no impact of pairwise links on eigenvector localization while the higher-order interactions instigate localization in the larger eigenvalues. For γ> 1, pair-wise interactions cause localization of eigenvector corresponding to small eigenvalues, where as higherorder interactions, despite being much lesser than the pair-wise links, keep driving localization of the eigenvectors corresponding to larger eigenvalues. The results will be useful to understand dynamical phenomena such as diffusion, and random walks on a range of real-world complex systems having higher-order interactions.
8 pages, 7 figures
References in corpus (16)
- Synchronization in complex networks
- Turing patterns in network-organized activator-inhibitor systems
- Random hypergraphs and their applications
- Random walks on hypergraphs
- Laplacian Spectra as a Diagnostic Tool for Network Structure and Dynamics
- Simplicial SIS model in scale-free uniform hypergraph
- Random matrix analysis of complex networks
- Evolution of Cooperation in the Presence of Higher-Order Interactions: from Networks to Hypergraphs
- Sparse repulsive coupling enhances synchronization in complex networks
- Random matrix analysis of network Laplacians
- Spectral Detection of Simplicial Communities via Hodge Laplacians
- Thermodynamics of spin systems on small-world hypergraphs
- Localization in random bipartite graphs: numerical and empirical study
- Multifractal analysis of eigenvectors of smallworld networks
- Eigenvector localization as a tool to study small communities in online social networks
- Random Matrix Analysis of Multiplex Networks