Controlling the Katz-Bonacich Centrality in Social Network: Application to gossip in Online Social Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

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.
Fichier principal
Vignette du fichier
draft5.pdf (239.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01217044 , version 1 (18-10-2015)

Identifiers

  • HAL Id : hal-01217044 , version 1

Cite

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⟩
164 View
1468 Download

Share

Gmail Facebook Twitter LinkedIn More