Enforcing Katz and PageRank Centrality Measures in Complex Networks

2024/09/04 by Stefano Cipolla, Fabio Durastante, Cipolla, Stefano +3 · 2 citations
Physics and Astronomy · #05C81 #05C82 #90C20 #FOS: Mathematics #FOS: Physical sciences #Numerical Analysis (math.NA) #Opinion Dynamics and Social Influence #Physics and Society (physics.soc-ph)

paper · pdf · doi:10.48550/arxiv.2409.02524

openalex publication_date 2024/09/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Kemeny's constant minimization for reversible Markov chains via structure-preserving perturbations
• The Derivative of Kemeny's Constant as a Centrality Measure in Undirected Graphs

Related

• Centrality Measures in Complex Networks: A Survey
• Efficient computation of Katz centrality for very dense networks via negative parameter Katz
• Controlling centrality in complex networks
• Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
• PageRank for Edges: Axiomatic Characterization