论文信息 - A New SNA Centrality Measure Quantifying the Distance to the Nearest Center

A New SNA Centrality Measure Quantifying the Distance to the Nearest Center

In Social Network Analysis (SNA) centrality measures focus on activity (degree), information access (betweenness), distance to all the nodes (closeness), or popularity (pagerank). We introduce a new measure quantifying the distance of nodes to the network center. It is called weighted distance to nearest center (WDNC) and it is based on edge-weighted closeness (EWC), a weighted version of closeness. The WDNC will be tested on two e-mail networks of the R community, one of the most important open source programs for statistical computing and graphics. We will find that there is a relationship between the WDNC and the formal organization of the R community.

[1] Stanley Wasserman,et al. Social Network Analysis: Methods and Applications , 1994 .

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

[3] Kurt Hornik,et al. Text Mining Infrastructure in R , 2008 .

[4] Michael Gertz,et al. Mining email social networks , 2006, MSR '06.

[5] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

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

[7] Stanley Wasserman,et al. Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[8] Kurt Hornik,et al. Social Network Analysis of Weighted Telecommunications Graphs , 2009 .