Attachment Centrality: An Axiomatic Approach to Connectivity in Networks

Centrality indices aim to quantify the importance of nodes or edges in a network. A number of new centrality indices have recently been proposed to try and capture the role of nodes in connecting the network. While these indices seem to deliver new insights, to date not enough is known about their theoretical properties. To address this issue, we propose an axiomatic approach. Specifically, we prove that there exists a unique centrality index satisfying some intuitive properties related to network connectivity. This new index, which we call Attachment Centrality, is equivalent to the Myerson value of a particular graph-restricted coalitional game. Building upon our theoretical analysis, we show that our Attachment Centrality has certain computational properties that are more attractive than the Myerson value for an arbitrary game.

[1]  Nicholas R. Jennings,et al.  Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality , 2014, J. Artif. Intell. Res..

[2]  Kathleen M. Carley,et al.  Generation of Realistic Social Network Datasets For Testing of Analysis and Simulation Tools , 2005 .

[3]  Oskar Skibski,et al.  Algorithms for the shapley and myerson values in graph-restricted games , 2014, AAMAS.

[4]  Y. Narahari,et al.  Determining the top-k nodes in social networks using the Shapley value , 2008, AAMAS.

[5]  Julia Belau,et al.  Consequences of Connection Failure - Centrality and the Importance for Cohesion , 2014 .

[6]  Stefan Richter,et al.  Centrality Indices , 2004, Network Analysis.

[7]  Rafael Amer,et al.  Accessibility in oriented networks , 2007, Eur. J. Oper. Res..

[8]  Boaz Golany,et al.  Evaluation of deregulated airline networks using data envelopment analysis combined with principal component analysis with an application to Western Europe , 2001, Eur. J. Oper. Res..

[9]  Chris Arney.  Network Analysis: Methodological Foundations , 2012 .

[10]  Sebastiano Vigna,et al.  Axioms for Centrality , 2013, Internet Math..

[11]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[12]  L. Shapley.  A Value for n-person Games , 1988 .

[13]  A. Barabasi,et al.  Halting viruses in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Rafael Amer,et al.  A connectivity game for graphs , 2004, Math. Methods Oper. Res..

[15]  Guillermo Owen,et al.  Centrality and power in social networks: a game theoretic approach , 2003, Math. Soc. Sci..

[16]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

[17]  Roger B. Myerson,et al.  Graphs and Cooperation in Games , 1977, Math. Oper. Res..

[18]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[19]  Nicholas R. Jennings,et al.  Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks , 2013, IJCAI.

[20]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[21]  Isaac Meilijson,et al.  Causal Localization of Neural Function: The Shapley Value Method , 2003, Neurocomputing.

[22]  Herbert Hamers,et al.  Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda , 2013, Eur. J. Oper. Res..

[23]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[24]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .