Metraipolis › archive › dc_4393bbf6604e
Influence Ranking Improvement via Link Addition in Social Networks — arXiv:2609.36791
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36791
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T17:26:26.418Z
- SHA-256 of the archived text
f3a37420efed2d8d57727292423dbabd5e89cb9a034f27b59a1a1f171adb5db3- Stable URL of this page
https://metraipolis.com/documento/dc_4393bbf6604e
How to cite
Influence Ranking Improvement via Link Addition in Social Networks — arXiv:2609.36791 — arXiv (en), https://arxiv.org/abs/2609.36791 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4393bbf6604e (Metraipolis archive dc_4393bbf6604e, sha256 f3a37420efed2d8d57727292423dbabd5e89cb9a034f27b59a1a1f171adb5db3)
BibTeX
@misc{dc4393bbf6604e,
title = {Influence Ranking Improvement via Link Addition in Social Networks — arXiv:2609.36791},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36791},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4393bbf6604e; sha256 f3a37420efed2d8d57727292423dbabd5e89cb9a034f27b59a1a1f171adb5db3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36791. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Social media platforms increasingly rely on influential users for information dissemination in domains such as marketing and political campaigns. As the value of being recognized as influential grows, users may have incentives to strategically enhance their influence. In this study, we investigate whether and to what extent the influence ranking of a target node can be improved by adding a limited number of outgoing links in the context of influence maximization (IM). We formulate the Link Selection Problem for Influence Ranking Improvement (LSP-IRI) as the problem of selecting a fixed-size set of additional outgoing links from a target node in order to maximize its rank improvement. To examine this problem, we consider two representative heuristic strategies: a greedy method that directly optimizes rank improvement and a computationally efficient random search method. We conduct experiments on four real-world networks ranging from thousands to hundreds of thousands of nodes. The results show that even a few added links can substantially improve IM-based influence rankings. In particular, the greedy method improves the ranks of nodes initially ranked around 50 by several tens of positions on average with only three added links, sometimes moving them into the top 10. The random search method achieves smaller gains under strict budgets but reduces computation time by up to approximately 98% compared with the greedy method and becomes effective when larger budgets are allowed. These findings show that IM-based influence rankings are sensitive to limited local structural modifications and highlight a trade-off between ranking improvement and computational efficiency. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-09-30 in cs.SI). Categorie arXiv: Social and Information Networks (cs.SI). Pagina del lavoro: https://arxiv.org/abs/2609.36791 — 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-07T16:58:01.660Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).