Papers › Uplifting edges in higher order networks: spectral centralities for non-uniform hypergraphs
Uplifting edges in higher order networks: spectral centralities for non-uniform hypergraphs
Gonzalo Contreras-Aso, Cristian Pérez-Corral, Miguel Romance
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Spectral analysis of networks states that many structural properties of graphs, such as centrality of their nodes, are given in terms of their adjacency matrices. The natural extension of such spectral analysis to higher order networks is strongly limited by the fact that a given hypergraph could have several different adjacency hypermatrices, hence the results obtained so far are mainly restricted to the class of uniform hypergraphs, which leaves many real systems unattended. A new method for analysing non-linear eigenvector-like centrality measures of non-uniform hypergraphs is presented in this paper that could be useful for studying properties of ℋ-eigenvectors and 𝒵-eigenvectors in the non-uniform case. In order to do so, a new operation - the uplift - is introduced, incorporating auxiliary nodes in the hypergraph to allow for a uniform-like analysis. We later argue why this is a mathematically sound operation, and we furthermore use it to classify a whole family of hypergraphs with unique Perron-like 𝒵-eigenvectors. We supplement the theoretical analysis with several examples and numerical simulations on synthetic and real datasets.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections