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.
Unable to display preview. Download preview PDF.
- Bird, C., Gourley, A., Devanbu, P., Gertz, M., & Swaminathan, A. (2006). Mining email social networks. In Proceedings of the 2006 international workshop on Mining software repositories, Shanghai, China (pp. 137–143).Google Scholar
- Bohn, A., Walchhofer, N., Mair, P., & Hornik, K. (2009). Social network analysis of weighted telecommunications graphs. Report 84, Department of Statistics and Mathematics, Wirtschaftsuniversität Wien, Research Report Series.Google Scholar
- Feinerer, I., Hornik, K., & Meyer, D. (2008). Text mining infrastructure in R. Journal of Statistical Software, 25(5), 1–54.Google Scholar
- Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Technical Report 8, Soviet Physics Doklady.Google Scholar
- R Development Core Team. (2009). R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria.Google Scholar