Omega-N: Interpretable Structural Node Descriptors and Their Applicability Domain
Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.
Computer Science > Social and Information Networks
Title:Omega-N: Interpretable Structural Node Descriptors and Their Applicability Domain
Abstract:A composite structural index summarises a network in one number; 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 for this index family stated that, and predicted: 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. This paper tests it.
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 for every local factor and a personalized-PageRank neighbourhood at several scales, giving ten interpretable features per node from the graph alone, with no attributes, training or embeddings.
Against a recursive feature engine at five levels of recursion, Omega-N wins on one and ties on four of six in-domain node-classification evaluations, with ten features against up to 252. Two statistics computed from the graph and labels, not from performance, partition the eight benchmarks without error, and the two they exclude are the two it loses.
The strongest application is drug-target prioritisation on protein interaction networks: +0.073 to +0.144 AUPRC over a centrality battery across four constructions, replicated on an independent AP-MS network and label source, surviving three bias controls (degree-matched, ten repetitions: +0.1047 and +0.1030, both 10/10, p=0.00195). The clearest negative sits in the same application: adding Omega-N to centralities plus Node2Vec changes nothing (+0.0014, p=0.31). The claim is narrow: ten interpretable features
| Comments: | 18 pages, 3 figures. Reference implementation, notebooks and data-preparation scripts at this https URL |
| Subjects: | Social and Information Networks (cs.SI); Machine Learning (cs.LG); Physics and Society (physics.soc-ph); Molecular Networks (q-bio.MN) |
| Cite as: | arXiv:2609.01633 [cs.SI] |
| (or arXiv:2609.01633v1 [cs.SI] for this version) | |
| https://doi.org/10.48550/arXiv.2609.01633
arXiv-issued DOI via DataCite
|
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
Current browse context:
References & Citations
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
More from arXiv — Machine Learning
-
Sparse Priors for Efficient Distribution Learning
Sep 21
-
Elastic Threshold Attention: Learned Contextual Sparsity for Long-Context Decoding
Sep 21
-
Bio-MF: Low-Latency and High-Fidelity EEG-to-fNIRS Cross-Modal Generation for Hybrid Motor-Imagery Brain--Computer Interfaces
Sep 21
-
Continuous Delayed-Memory Stochastic Gradient Descent and Continuous-Time Reinforcement Learning from History of Astrophysical Time Series Studies
Sep 21
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.