arXiv · 2409.02524
Enforcing Katz and PageRank Centrality Measures in Complex Networks
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Stefano Cipolla, Fabio Durastante, Beatrice Meini. 2024-09-04. Enforcing Katz and PageRank Centrality Measures in Complex Networks. https://arxiv.org/abs/2409.02524
Cite the original work for its findings. Save a collection to share your selection of sources.