Resistance distance, closeness, and betweenness

Social Networks

Volumn 35, Issue 3, 2013, Pages 460-469

  Bozzo, Enrico ^a   Franceschet, Massimo ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

Betweenness centrality; Closeness centrality; Geodesic distance; Information; Resistance distance

Indexed keywords

EID: 84880578294     PISSN: 03788733     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.socnet.2013.05.003     Document Type: Article

References (27)

1. Backstrom L., Boldi P., Rosa M., Ugander J., Vigna S. Four degrees of separation. ACM Web Science 2012, 45-54.
2. Balaban A.T., Klein D.J. Co-authorship, rational Erdos numbers, and resistance distances in graphs. Scientometrics 2002, 55(1):59-70.
3. Bavelas A. A mathematical model for group structure. Human Organizations 1948, 7(3):16-30.
4. Beauchamp A.M. An improved index of centrality. Behavioral Science 1965, 10(2):161-163.
5. Ben-Israel A., Greville T.N. Generalized Inverses. Theory and Applications, 2nd ed. 2003, Springer, New York.
6. Borgatti S.P. Centrality and network flow. Social Networks 2005, 27(1):55-71.
7. Borgatti S.P., Everett M.G. A graph-theoretic perspective on centrality. Social Networks 2006, 28(4):466-484.
8. Bozzo E., Franceschet M. Approximations of the generalized inverse of the graph Laplacian matrix. Internet Mathematics 2012, 8(4):1-26.
9. Network Analysis: Methodological Foundations. Vol. 3418 of Lecture Notes in Computer Science 2005, Springer, Berlin Heidelberg. U. Brandes, T. Erlebach (Eds.).
10. Brandes U., Fleischer D. Centrality measures based on current flow. STACS 2005, 533-544.
11. Erdos P. On the fundamental problem of mathematics. The American Mathematical Monthly 1972, 79(2):149-150.
12. Freeman L.C. A set of measures of centrality based upon betweenness. Sociometry 1977, 40:35-41.
13. Freeman L.C., Borgatti S.P., White D.R. Centrality in valued graphs: a measure of betweenness based on network flow. Social Networks 1991, 13(2):141-154.
14. Ghosh A., Boyd S., Saberi A. Minimizing effective resistance of a graph. SIAM Review 2008, 50(1):37-66.
15. Golub G.H., Meurant G. Matrices, moments and quadrature with applications. Princeton Series in Applied Mathematics 2010, Princeton University Press, Princeton, Oxford.
16. Klein D.J., Randić M. Resistance distance. Journal of Mathematical Chemistry 1993, 12(1):81-95.
17. Lusseau D., Newman M.E.J. Identifying the role that animals play in their social networks. Proceedings of the Royal Society B: Biological Sciences 2004, 271:S477-S548.
18. Milgram S. The small world problem. Physiology Today 1967, 2:60-67.
19. Newman M. A measure of betweenness centrality based on random walks. Social Networks 2005, 27(1):39-54.
20. Newman M.E.J. Networks: An introduction 2010, Oxford University Press, Oxford.
21. Newman M.E.J., Girvan M. Finding and evaluating community structure in networks. Physical Review E 2004, 69:026113.
22. Noh J.D., Rieger H. Random walks on complex networks. Physical Review Letters 2004, 92:118701.
23. Sabidussi G. The centrality index of a graph. Psychometrika 1966, 31:581-603.
24. Shimbel A. Structural parameters of communication networks. Bulletin of Mathematical Biology 1953, 15:501-507.
25. Stephenson K., Zelen M. Rethinking centrality: methods and examples. Social Networks 1989, 11(1):1-37.
26. Tang J.M., Saad Y. A probing method for computing the diagonal of a matrix inverse. Numerical Linear Algebra with Applications 2012, 19(3):485-501.
27. Zhan C., Chen G., Yeung L.F. On the distributions of Laplacian eigenvalues versus node degrees in complex networks. Physica A: Statistical Mechanics and its Applications 2010, 389(8):1779-1788.