Metraipolis › archive › dc_35ed4bd562d5
Spectral Efficiency Centrality: An Efficient Spectral Approach for Influential Node Identification in Temporal Networks — arXiv:2608.13960
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.13960
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T02:29:11.712Z
- SHA-256 of the archived text
1ed8f91d1f9b0b2a6fd00731d7866a6029353cbb9b6fa381bd528f89627ebd9f- Stable URL of this page
https://metraipolis.com/documento/dc_35ed4bd562d5
How to cite
Spectral Efficiency Centrality: An Efficient Spectral Approach for Influential Node Identification in Temporal Networks — arXiv:2608.13960 — arXiv (en), https://arxiv.org/abs/2608.13960 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_35ed4bd562d5 (Metraipolis archive dc_35ed4bd562d5, sha256 1ed8f91d1f9b0b2a6fd00731d7866a6029353cbb9b6fa381bd528f89627ebd9f)
BibTeX
@misc{dc35ed4bd562d5,
title = {Spectral Efficiency Centrality: An Efficient Spectral Approach for Influential Node Identification in Temporal Networks — arXiv:2608.13960},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.13960},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_35ed4bd562d5; sha256 1ed8f91d1f9b0b2a6fd00731d7866a6029353cbb9b6fa381bd528f89627ebd9f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13960. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Centrality measures play a vital role in identifying influential nodes in evolving networks. While existing temporal centrality measures primarily rely on local structural properties or temporal paths, spectral node-removal approaches have been largely limited to static networks. To bridge this gap, we propose Spectral Efficiency Centrality (SEC), a temporal spectral centrality framework that quantifies node importance by evaluating the change in spectral radius caused by node removal across temporal snapshots. By capturing the global structural influence of nodes throughout network evolution, SEC identifies nodes that are critical for preserving the structural connectivity and efficiency of temporal networks. To improve computational scalability, we further develop an efficient approximation, ASEC, based on Perron-Frobenius theory and first-order eigenvalue perturbation. ASEC requires only the leading eigenpair and avoids repeated eigendecomposition, making it suitable for large temporal networks. Extensive experiments on multiple real-world temporal datasets demonstrate that SEC and ASEC outperform existing baseline centrality measures in identifying influential nodes under SI, SIS, and IC diffusion models. Statistical significance and robustness analyses further confirm their effectiveness, while ASEC offers a computationally efficient solution for large-scale temporal networks. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-08-17 in cs.SI). Categorie arXiv: Social and Information Networks (cs.SI). Pagina del lavoro: https://arxiv.org/abs/2608.13960 — 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-19T02:25:23.017Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-08-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).