The University of Southampton
University of Southampton Institutional Repository

Enforcing Katz and PageRank centrality measures in complex networks

Enforcing Katz and PageRank centrality measures in complex networks
Enforcing Katz and PageRank centrality measures in complex networks

We investigate the problem of enforcing a desired centrality measure in complex networks, while still keeping the original pattern of the network. Specifically, by representing the network as a graph with suitable nodes and weighted edges, we focus on computing the smallest perturbation on the weights required to obtain a prescribed PageRank or Katz centrality index for the nodes. Our approach relies on optimization procedures that scale with the number of modified edges, enabling the exploration of different scenarios and altering network structure and dynamics.

Katz, PageRank, centrality, complex network, optimization
1514-1539
Cipolla, Stefano
373fdd4b-520f-485c-b36d-f75ce33d4e05
Durastante, Fabio
56118788-83b2-4273-b959-c45f486f86c1
Meini, Beatrice
a8776603-c607-4e38-ac43-e277f5275256
Cipolla, Stefano
373fdd4b-520f-485c-b36d-f75ce33d4e05
Durastante, Fabio
56118788-83b2-4273-b959-c45f486f86c1
Meini, Beatrice
a8776603-c607-4e38-ac43-e277f5275256

Cipolla, Stefano, Durastante, Fabio and Meini, Beatrice (2025) Enforcing Katz and PageRank centrality measures in complex networks. SIAM Journal on Mathematics of Data Science, 7 (3), 1514-1539. (doi:10.48550/arXiv.2409.02524).

Record type: Article

Abstract

We investigate the problem of enforcing a desired centrality measure in complex networks, while still keeping the original pattern of the network. Specifically, by representing the network as a graph with suitable nodes and weighted edges, we focus on computing the smallest perturbation on the weights required to obtain a prescribed PageRank or Katz centrality index for the nodes. Our approach relies on optimization procedures that scale with the number of modified edges, enabling the exploration of different scenarios and altering network structure and dynamics.

Text
2409.02524v2 - Accepted Manuscript
Download (918kB)

More information

Accepted/In Press date: 11 March 2025
e-pub ahead of print date: 30 September 2025
Keywords: Katz, PageRank, centrality, complex network, optimization

Identifiers

Local EPrints ID: 506342
URI: http://eprints.soton.ac.uk/id/eprint/506342
PURE UUID: 10f2edfc-5708-44d4-9dbd-b9d8ff60c4bd
ORCID for Stefano Cipolla: ORCID iD orcid.org/0000-0002-8000-4719

Catalogue record

Date deposited: 04 Nov 2025 18:13
Last modified: 12 Nov 2025 03:06

Export record

Altmetrics

Contributors

Author: Stefano Cipolla ORCID iD
Author: Fabio Durastante
Author: Beatrice Meini

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×