Abstract
AbstractNetwork scientists have shown that there is great value in studying pairwise interactions between components in a system. From a linear algebra point of view, this involves defining and evaluating functions of the associated adjacency matrix. Recent work indicates that there are further benefits from accounting directly for higher order interactions, notably through a hypergraph representation where an edge may involve multiple nodes. Building on these ideas, we motivate, define and analyze a class of spectral centrality measures for identifying important nodes and hyperedges in hypergraphs, generalizing existing network science concepts. By exploiting the latest developments in nonlinear Perron−Frobenius theory, we show how the resulting constrained nonlinear eigenvalue problems have unique solutions that can be computed efficiently via a nonlinear power method iteration. We illustrate the measures on realistic data sets.
Publisher
Springer Science and Business Media LLC
Subject
General Physics and Astronomy
Reference38 articles.
1. Estrada, E. & Knight, P. A. A First Course in Network Theory (Oxford University Press, 2015).
2. Newman, M. E. J. Networks: An Introduction (Oxford University Press, 2010).
3. Battiston, F. et al. Networks beyond pairwise interactions: structure and dynamics. Phys. Rep. 874, 1–92 (2020).
4. Estrada, E. & Rodriguez-Velázquez, J. A. Subgraph centrality and clustering in complex hyper-networks. Physica A: Stat. Mech. Appl. 364, 581–594 (2006).
5. Torres, L. Blevins, A. S., Bassett, D. S. & Eliassi-Rad, T. The why, how, and when of representations for complex systems. SIAM Rev. 63, 435-485 (2021).
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献