Resistance distance, closeness, and betweenness

被引:65
作者
Bozzo, Enrico [1 ]
Franceschet, Massimo [1 ]
机构
[1] Univ Udine, Dept Math & Comp Sci, I-33100 Udine, Italy
关键词
Information; Resistance distance; Geodesic distance; Closeness centrality; Betweenness centrality; CENTRALITY;
D O I
10.1016/j.socnet.2013.05.003
中图分类号
Q98 [人类学];
学科分类号
030303 ;
摘要
In a seminal paper Stephenson and Zelen (1989) rethought centrality in networks proposing an information-theoretic distance measure among nodes in a network. The suggested information distance diverges from the classical geodesic metric since it is sensible to all paths (not just to the shortest ones) and it diminishes as soon as there are more routes between a pair of nodes. Interestingly, information distance has a clear interpretation in electrical network theory that was missed by the proposing authors. When a fixed resistor is imagined on each edge of the graph, information distance, known as resistance distance in this context, corresponds to the effective resistance between two nodes when a battery is connected across them. Here, we review resistance distance, showing once again, with a simple proof, that it matches information distance. Hence, we interpret both current-flow closeness and current-flow betweenness centrality in terms of resistance distance. We show that this interpretation has semantic, theoretical, and computational benefits. (c) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:460 / 469
页数:10
相关论文
共 27 条
[1]  
[Anonymous], 1948, Human organization, DOI DOI 10.17730/HUMO.7.3.F4033344851GL053
[2]  
[Anonymous], 2003, Generalized Inverses. Theory and Applications, DOI [DOI 10.1007/B97366, 10.1007/b97366]
[3]  
Backstrom L, 2012, PROCEEDINGS OF THE 3RD ANNUAL ACM WEB SCIENCE CONFERENCE, 2012, P33
[4]   Co-authorship, rational Erdos numbers, and resistance distances in graphs [J].
Balaban, AT ;
Klein, DJ .
SCIENTOMETRICS, 2002, 55 (01) :59-70
[5]   AN IMPROVED INDEX OF CENTRALITY [J].
BEAUCHAMP, MA .
BEHAVIORAL SCIENCE, 1965, 10 (02) :161-163
[6]   Centrality and network flow [J].
Borgatti, SP .
SOCIAL NETWORKS, 2005, 27 (01) :55-71
[7]   A graph-theoretic perspective on centrality [J].
Borgatti, Stephen P. ;
Everett, Martin G. .
SOCIAL NETWORKS, 2006, 28 (04) :466-484
[8]   Approximations of the Generalized Inverse of the Graph Laplacian Matrix [J].
Bozzo, Enrico ;
Franceschet, Massimo .
INTERNET MATHEMATICS, 2012, 8 (04) :456-481
[9]  
Brandes U, 2005, LECT NOTES COMPUT SC, V3404, P533
[10]  
Brandes U., 2005, Lecture Notes in Computer ScienceLNCS, V3418