Interplay between Social Influence and Network Centrality: A Comparative Study on Shapley Centrality and Single-Node-Influence Centrality

We study network centrality based on dynamic influence propagation models in social networks. To illustrate our integrated mathematical-algorithmic approach for understanding the fundamental interplay between dynamic influence processes and static network structures, we focus on two basic centrality measures: (a) Single Node Influence (SNI) centrality, which measures each node's significance by its influence spread; and (b) Shapley Centrality, which uses the Shapley value of the influence spread function --- formulated based on a fundamental cooperative-game-theoretical concept --- to measure the significance of nodes. We present a comprehensive comparative study of these two centrality measures. Mathematically, we present axiomatic characterizations, which precisely capture the essence of these two centrality measures and their fundamental differences. Algorithmically, we provide scalable algorithms for approximating them for a large family of social-influence instances. Empirically, we demonstrate their similarity and differences in a number of real-world social networks, as well as the efficiency of our scalable algorithms. Our results shed light on their applicability: SNI centrality is suitable for assessing individual influence in isolation while Shapley centrality assesses individuals' performance in group influence settings.

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

[2]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[3]  M. Prokopenko,et al.  Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks , 2013, PloS one.

[4]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

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

[6]  Roger B. Myerson,et al.  Game theory - Analysis of Conflict , 1991 .

[7]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[8]  References , 1971 .

[9]  L. A. Goodman,et al.  Social Choice and Individual Values , 1951 .

[10]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[11]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[12]  Nicola Barbieri,et al.  Topic-aware social influence propagation models , 2012, Knowledge and Information Systems.

[13]  Moshe Tennenholtz,et al.  Ranking systems: the PageRank axioms , 2005, EC '05.

[14]  Shang-Hua Teng,et al.  Network Essence: PageRank Completion and Centrality-Conforming Markov Chains , 2017, ArXiv.

[15]  Fan Chung Graham,et al.  Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..

[16]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[17]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[18]  Shang-Hua Teng,et al.  Scalable Algorithms for Data and Network Analysis , 2016, Found. Trends Theor. Comput. Sci..

[19]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[20]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[21]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[22]  Ulrik Brandes,et al.  Re-conceptualizing centrality in social networks† , 2016, European Journal of Applied Mathematics.

[23]  Kristina Lerman,et al.  Rethinking Centrality: The Role of Dynamical Processes in Social Network Analysis , 2012, ArXiv.

[24]  Jimeng Sun,et al.  Social influence analysis in large-scale networks , 2009, KDD.

[25]  Oscar Volij,et al.  The Measurement of Intellectual Influence , 2002 .

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

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

[28]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[29]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[30]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[31]  U. J. Nieminen.  On the centrality in a directed graph , 1973 .

[32]  Aravind Srinivasan,et al.  Probability and Computing , 2018, SIGA.

[33]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.

[34]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[35]  Kristina Lerman,et al.  The interplay between dynamics and networks: centrality, communities, and cheeger inequality , 2014, KDD.

[36]  Wei Chen,et al.  Scalable influence maximization for independent cascade model in large-scale social networks , 2012, Data Mining and Knowledge Discovery.

[37]  L. S. Shapley,et al.  17. A Value for n-Person Games , 1953 .

[38]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .