Controlling the Katz-Bonacich Centrality in Social Network: Application to Gossip in Online Social Networks

Abstract

Recent papers studied the control of spectral centrality measures of a network by manipulating the topology of the network. We extend these works by focusing on a specific spectral centrality measure, the Katz-Bonacich centrality. The optimization of the Katz-Bonacich centrality using a topological control is called the Katz-Bonacich optimization problem. We first prove that this problem is equivalent to a linear optimization problem. Thus, in the context of large graphs, we can use state of the art algorithms. We provide a specific applications of the Katz-Bonacich centrality minimization problem based on the minimization of gossip propagation and make some experiments on real networks.