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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-01217044
Contributor : Eitan Altman <>
Submitted on : Sunday, October 18, 2015 - 8:12:51 PM
Last modification on : Saturday, March 23, 2019 - 1:22:15 AM
Long-term archiving on : Thursday, April 27, 2017 - 6:42:07 AM

File

draft5.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01217044, version 1

Collections

Citation

Alexandre Reiffers-Masson, Eitan Altman, Yezekael Hayel. Controlling the Katz-Bonacich Centrality in Social Network: Application to gossip in Online Social Networks. 3rd International Workshop on Big Data and Social Networking Management and Security (BDSN 2015), Dec 2015, Limassol, Cyprus. ⟨hal-01217044⟩

Share

Metrics

Record views

301

Files downloads

1153