Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.01633

Omega-N: Interpretable Structural Node Descriptors and Their Applicability Domain

Alberto Acedo
View original source ↗Read source document ↗Export metadata ↓

Abstract

A composite structural index summarises a network in one number, and for a triangle-based index it is spectrally redundant: Tr(A^3) is the third moment of the adjacency spectrum. The non-redundant content sits one level down, in diag(A^3), which depends on eigenvectors and is not spectrally determined. A corollary in the theory paper predicted that the global scalar should tie sharpened spectral baselines rather than beat them, while the node-wise attribution should do better where the number of structural epicentres is unknown. We construct Omega-N by localizing each of the four factors. The direct localization is badly conditioned; two corrections from published practice fix it, a configuration-null excess per factor and a personalized-PageRank neighbourhood at several scales, giving ten interpretable features per node, with no attributes, training or embeddings. Against a recursive feature engine at five levels of recursion, Omega-N wins on three and ties on two of the six in-domain evaluations, the sixth a declared null where every arm returns chance, with ten features against its 28 to 252 before pruning. Two statistics from the graph and labels, not from performance, partition the eight benchmarks without error, and the two they exclude are the two on which it loses. The strongest application is drug-target prioritisation on protein interaction networks: +0.032 to +0.103 AUPRC over a six-feature centrality battery and +0.084 to +0.208 over the four-feature one, across three constructions, replicated on an independent AP-MS network and label source (degree-matched: +0.0723 on STRING, +0.0560 on BioPlex, p=0.00195). Adding Omega-N to centralities plus Node2Vec changes nothing. The claim is narrow and it is the point: ten named features, computed without training, match or beat hand-crafted centralities and a recursive engine, and do not touch learned representations.

Explore related subjects

cs.SIcs.LGphysics.soc-phq-bio.MN

Keep this discovery

BibTeXRIS

Alberto Acedo. 2026-09-04. Omega-N: Interpretable Structural Node Descriptors and Their Applicability Domain. https://arxiv.org/abs/2609.01633

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.LG subjectcs.SI subjectphysics.soc-ph subjectq-bio.MN subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2022

Hypergraph reconstruction from noisy pairwise observations

The network reconstruction task aims to estimate a complex system's structure from various data sources such as time series, snapshots, or interaction counts. Recent work has examined this problem in networks whose relationships involve precisely two entities-the pairwise case. Here we investigate the general problem of reconstructing a network in which higher-order interactions are also present. We study a minimal example of this problem, focusing on the case of hypergraphs with interactions between pairs and triplets of vertices, measured imperfectly and indirectly. We derive a Metropolis-Hastings-within-Gibbs algorithm for this model and use the algorithms to highlight the unique challenges that come with estimating higher-order models. We show that this approach tends to reconstruct empirical and synthetic networks more accurately than an equivalent graph model without higher-order interactions.

cs.SI↗
arXiv2026

Behavioral calibration of mobile-phone GPS data for population-representative analyses

Mobile phone mobility data have transformed the study of human behavior, but demographic and behavioral biases can compromise their representativeness and distort population-level inference. Existing calibration approaches primarily address demographic and geographic representativeness, leaving behavioral discrepancies largely uncorrected. Here we introduce the Behavioral Population (BePop) framework, which jointly calibrates mobility data to representative demographic and behavioral distributions using census data and time-use surveys. BePop embeds mobility sequences into behavioral profiles and estimates person-level weights that align both population composition and daily activity patterns. Across three U.S. metropolitan areas, the framework consistently improves agreement between GPS-derived mobility and representative behavioral distributions, including time allocation, activity transitions, and mobility motifs. Calibration also substantially alters downstream mobility indicators, demonstrating that behavioral biases can propagate into commonly used mobility measures. Our results establish behavioral representativeness as a critical complement to demographic calibration and provide a general framework for population-representative mobility inference.

physics.soc-ph↗
arXiv2021

Detecting the ultra low dimensionality of real networks

Reducing dimension redundancy to find simplifying patterns in high-dimensional datasets and complex networks has become a major endeavor in many scientific fields. However, detecting the dimensionality of their latent space is challenging but necessary to generate efficient embeddings to be used in a multitude of downstream tasks. Here, we propose a method to infer the dimensionality of networks without the need for any a priori spatial embedding. Due to the ability of hyperbolic geometry to capture the complex connectivity of real networks, we detect ultra low dimensionality far below values reported using other approaches. We applied our method to real networks from different domains and found unexpected regularities, including: tissue-specific biomolecular networks being extremely low dimensional; brain connectomes being close to the three dimensions of their anatomical embedding; and social networks and the Internet requiring slightly higher dimensionality. Beyond paving the way towards an ultra efficient dimensional reduction, our findings help address fundamental issues that hinge on dimensionality, such as universality in critical behavior.

physics.soc-ph↗