Eigenvector localization in hypergraphs: pair-wise vs higher-order links
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.