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.
arXiv comment8 pages, 7 figures
References in corpus (45)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Synchronization in complex networks
- Evolution of networks
- Synchronization in small-world systems
- Networks beyond pairwise interactions: structure and dynamics
- Scaling and percolation in the small-world network model
- Universal and non-universal properties of cross-correlations in financial time series
- Synchronization reveals topological scales in complex networks
- Random walks and diffusion on networks
- Evolutionary dynamics of higher-order interactions in social networks
- Turing patterns in network-organized activator-inhibitor systems
- Turing patterns on networks
- Localization and Spreading of Diseases in Complex Networks
- Complex Networks as Hypergraphs
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- The onset of synchronization in large networks of coupled oscillators
- Random hypergraphs and their applications
- Social contagion models on hypergraphs
- Random walks on hypergraphs
- Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes
- Diffusion, localization and dispersion relations on ``small-world'' lattices
- Coupled Dynamics on Hypergraphs: Master Stability of Steady States and Synchronization
- Laplacian Spectra as a Diagnostic Tool for Network Structure and Dynamics
- Simplicial SIS model in scale-free uniform hypergraph
- Hypergraph topological quantities for tagged social networks
- Simplicial complexes: higher-order spectral dimension and dynamics
- Random matrix analysis of complex networks
- Temporal network structures controlling disease spreading
- May's Instability in Large Economies
- Spectral properties 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
- Critical fluctuations in spatial complex networks
- The inverse Mermin-Wagner theorem for classical spin models on graphs
- Random matrix analysis of network Laplacians
- Spectral Detection of Simplicial Communities via Hodge Laplacians
- Spectral Properties of Directed Random Networks with Modular Structure
- Principal eigenvector localization and centrality in networks: revisited
- Origin and implications of zero degeneracy in networks spectra
- Thermodynamics of spin systems on small-world hypergraphs
- Localization in random bipartite graphs: numerical and empirical study
- Eigenvector localization as a tool to study small communities in online social networks
- Multifractal analysis of eigenvectors of smallworld networks
- Random Matrix Analysis of Multiplex Networks