Prior-residual learning for ranking future influential nodes in temporal networks

Abstract Whether temporal learning adds anything to a strong structural forecast is rarely tested directly. We recast future influential-node ranking as a prior–residual problem: a chronologically selected centrality prior plus a learned correction whose weight is fixed on validation data before the test period is seen. Across nine networks the correction raises mean Kendall agreement by 0.0203 under the original protocol and by 0.0120 when tied scores are preserved, with a zero median and four positive networks. Because five of the nine differences are exactly zero, the adjusted test cannot discriminate, so we evaluate the correction as a decision rather than an average. Validation abstains in 26 of 45 fits and returns the prior unchanged; in the 19 fits where it opens, 17 gain. Residual structure is predictable out of sample (positive squared-error skill in 45 of 45 fits), yet head-node retrieval and graph-filtered features gain nothing. The contribution is an auditable rule for when a learned correction should be trusted.

Authors

Institutions

Publication Details

Journal
Physica Scripta
Published
2026-11-02
DOI
https://doi.org/10.1088/1402-4896/aebcd8
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prior-residual learning for ranking future influential nodes in temporal networks

Qiong Niu, Jing Tan
1 links
Physica Scripta
Complex Network Analysis Techniques
article

Prior-residual learning for ranking future influential nodes in temporal networks

Qiong Niu, Jing Tan
article en

Abstract

Abstract Whether temporal learning adds anything to a strong structural forecast is rarely tested directly. We recast future influential-node ranking as a prior–residual problem: a chronologically selected centrality prior plus a learned correction whose weight is fixed on validation data before the test period is seen. Across nine networks the correction raises mean Kendall agreement by 0.0203 under the original protocol and by 0.0120 when tied scores are preserved, with a zero median and four positive networks. Because five of the nine differences are exactly zero, the adjusted test cannot discriminate, so we evaluate the correction as a decision rather than an average. Validation abstains in 26 of 45 fits and returns the prior unchanged; in the 19 fits where it opens, 17 gain. Residual structure is predictable out of sample (positive squared-error skill in 45 of 45 fits), yet head-node retrieval and graph-filtered features gain nothing. The contribution is an auditable rule for when a learned correction should be trusted.

Physica Scripta
Wanjiang University of Technology (CN)
Openalex Percentile: Top 16%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon