Metraipolis › archive › dc_61ac4e2b124d

Link prediction in complex networks via fusing node centrality and local similarity indices: a fair-protocol reassessment and parameter design principles — arXiv:2609.09658

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09658
License (as archived)
CC0-1.0
Archived
2026-10-16T07:54:34.447Z
SHA-256 of the archived text
25bc45803bb4e3504e127c6945851cbbbf496e940748da46c8fa73a3ea4dba5e
Stable URL of this page
https://metraipolis.com/documento/dc_61ac4e2b124d

How to cite

Link prediction in complex networks via fusing node centrality and local similarity indices: a fair-protocol reassessment and parameter design principles — arXiv:2609.09658 — arXiv (en), https://arxiv.org/abs/2609.09658 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_61ac4e2b124d (Metraipolis archive dc_61ac4e2b124d, sha256 25bc45803bb4e3504e127c6945851cbbbf496e940748da46c8fa73a3ea4dba5e)
BibTeX
@misc{dc61ac4e2b124d,
  title = {Link prediction in complex networks via fusing node centrality and local similarity indices: a fair-protocol reassessment and parameter design principles — arXiv:2609.09658},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09658},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_61ac4e2b124d; sha256 25bc45803bb4e3504e127c6945851cbbbf496e940748da46c8fa73a3ea4dba5e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09658. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We reassess a published fusion method under a fair protocol. Local similarity indices are cheap but score every node pair without common neighbors zero, and weighting them by a node centrality product, as proposed for PageRank, is not robust once the protocol is made comparable across indices; on our eight-network panel the reported improvement does not survive that protocol for six of the seven local indices. We study these issues in a unified piecewise framework that modulates the local score multiplicatively by a centrality product when local information suffices and uses a small-dose centrality product as a completion term when it does not. A scale analysis and a reassessment on eight real-world networks (five-fold cross-validation, exhaustive negative samples) trace this to the O(n^-2) scale of the PageRank product, whose modulation factor is then a near-identity map, and to its rank correlation with degree exceeding 0.89; control arms show scale calibration is necessary but not sufficient. The min-max normalized DomiRank product instead has an O(1) range and substantial non-degree content, and a grid search yields unified parameters (omega=5, c=0.1) under which DR-JC/HPI/SO significantly outperform their local baselines already at the dataset level (p=0.027 and 0.035), the remaining four at the fold level only; DR-RA attains an average AUC of 0.9257, above nine of ten comparison methods, whereas degree-only preferential attachment reaches only 0.7736. Mechanism decomposition shows the two mechanisms contribute differently across index families and should be dosed separately, yielding a safety boundary 0 < c <= 0.3, a plateau omega in [0.5, 12] and a near-critical plateau sigma in [0.7, 0.95]. Two negative results bound the claim: under a degree-corrected benchmark the gains over local baselines vanish and reverse in sign, and the AUC gains do not translate into top-L hit rate.

Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-10 in cs.SI).
Categorie arXiv: Social and Information Networks (cs.SI).
Pagina del lavoro: https://arxiv.org/abs/2609.09658 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T07:35:38.033Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).