Compute current-flow closeness centrality for nodes.
A variant of closeness centrality based on effective resistance between nodes in a network. This metric is also known as information centrality.
Parameters : | G : graph
normalized : bool, optional
dtype: data type (float) :
solver: string (default=’lu’) :
|
---|---|
Returns : | nodes : dictionary
|
See also
Notes
The algorithm is from Brandes [R143].
See also [R144] for the original definition of information centrality.
References
[R143] | (1, 2) Ulrik Brandes and Daniel Fleischer, Centrality Measures Based on Current Flow. Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS ‘05). LNCS 3404, pp. 533-544. Springer-Verlag, 2005. http://www.inf.uni-konstanz.de/algo/publications/bf-cmbcf-05.pdf |
[R144] | (1, 2) Stephenson, K. and Zelen, M. Rethinking centrality: Methods and examples. Social Networks. Volume 11, Issue 1, March 1989, pp. 1-37 http://dx.doi.org/10.1016/0378-8733(89)90016-6 |