Metraipolis › archive › dc_8e7bd83eaa35
Semi-Monotonicity for Spectral Centrality Measures — arXiv:2609.24683
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.24683
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T07:00:16.553Z
- SHA-256 of the archived text
3669e59017f1da3dafd90ad5b4fc2bc75711700b13a529b57c938bf9c6fba713- Stable URL of this page
https://metraipolis.com/documento/dc_8e7bd83eaa35
How to cite
Semi-Monotonicity for Spectral Centrality Measures — arXiv:2609.24683 — arXiv (en), https://arxiv.org/abs/2609.24683 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8e7bd83eaa35 (Metraipolis archive dc_8e7bd83eaa35, sha256 3669e59017f1da3dafd90ad5b4fc2bc75711700b13a529b57c938bf9c6fba713)
BibTeX
@misc{dc8e7bd83eaa35,
title = {Semi-Monotonicity for Spectral Centrality Measures — arXiv:2609.24683},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.24683},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8e7bd83eaa35; sha256 3669e59017f1da3dafd90ad5b4fc2bc75711700b13a529b57c938bf9c6fba713},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24683. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Score monotonicity and rank monotonicity are properties describing the behavior of a centrality measure when an arc is added to a network: the former requires that the score of the target of the arc should increase, the latter that its importance with respect to the remaining nodes should not deteriorate. While in directed networks almost all classical centrality measures satisfy both properties, in undirected networks they fail for most measures: adding an edge can reduce the score or the rank of one of its endpoints. Semi-monotonicity is a recently introduced weaker property for undirected networks, requiring that at least one of the two endpoints of the new edge enjoys monotonicity, and it is known to hold for closeness, harmonic centrality, distance-decay centralities and betweenness. In this paper we study semi-monotonicity for three classical spectral centrality measures: eigenvector centrality, Katz's index, and PageRank. We prove that all of them are strictly rank semi-monotone on connected undirected graphs, and that all of them are also score semi-monotone, (the only exception being eigenvector centrality when scores are normalized by projecting the constant vector on the dominant eigenspace, for which we provide a counterexample). In particular, adding an edge can never decrease the PageRank of both its endpoints, which answers a question left open in previous work. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-22 in cs.SI). Categorie arXiv: Social and Information Networks (cs.SI). Pagina del lavoro: https://arxiv.org/abs/2609.24683 — 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-09T06:53:42.935Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).