A new approach to betweenness centrality based on the Shapley Value
暂无分享,去创建一个
[1] Stanley Wasserman,et al. Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.
[2] Yingqian Zhang,et al. Preventing Under-Reporting in Social Task Allocation , 2010, AMEC/TADA.
[3] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[4] V. Latora,et al. The Network Analysis of Urban Streets: A Primal Approach , 2006 .
[5] Martin G. Everett,et al. A Graph-theoretic perspective on centrality , 2006, Soc. Networks.
[6] Ronald J. Gutman,et al. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.
[7] L. Freeman. Centrality in social networks conceptual clarification , 1978 .
[8] FaloutsosMichalis,et al. On power-law relationships of the Internet topology , 1999 .
[9] Hawoong Jeong,et al. Modeling the Internet's large-scale topology , 2001, Proceedings of the National Academy of Sciences of the United States of America.
[10] Arun K. Ramani,et al. Protein interaction networks from yeast to human. , 2004, Current opinion in structural biology.
[11] A. Shimbel. Structural parameters of communication networks , 1953 .
[12] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[13] Nicholas R. Jennings,et al. Efficient Computation of the Shapley Value for Centrality in Networks , 2010, WINE.
[14] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[15] Makoto Yokoo,et al. Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem , 2010, AAMAS.
[16] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[17] U. Brandes. A faster algorithm for betweenness centrality , 2001 .
[18] Rami Puzis,et al. Collaborative attack on Internet users' anonymity , 2009, Internet Res..
[19] Guillermo Owen,et al. Centrality and power in social networks: a game theoretic approach , 2003, Math. Soc. Sci..
[20] Y. Narahari,et al. Determining the top-k nodes in social networks using the Shapley value , 2008, AAMAS.
[21] Stefan Richter,et al. Centrality Indices , 2004, Network Analysis.
[22] M. Barthelemy. Betweenness centrality in large complex networks , 2003, cond-mat/0309436.
[23] Alessandro Vespignani,et al. Immunization of complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[24] L. Shapley. A Value for n-person Games , 1988 .
[25] Ulrik Brandes,et al. Centrality Measures Based on Current Flow , 2005, STACS.
[26] F. Harary,et al. Eccentricity and centrality in networks , 1995 .
[27] Ulrik Brandes,et al. On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.
[28] Béla Bollobás,et al. Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..
[29] S. Borgatti,et al. The centrality of groups and classes , 1999 .
[30] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.