Avg Path Length
From Gephi:Wiki
Avg Path Length
|
The average graph-distance between all pairs of nodes.
Objective
Description
Connected nodes have graph distance 1. The diameter is the longest graph distance between any two nodes in the network. (i.e. How far apart are the two most distant nodes).
Two measures derive from the distance: Betweenness Centrality and Closeness Centrality.
Source code
See org.gephi.statistics.plugin.GraphDistance.java.
Acknowledgments
This code was implemented by Patrick McSweeney.
Implemented Algorithm
Ulrik Brandes (2001). A faster algorithm for betweenness centrality PDF
Reference
- Albert, R., and Barabasi, A.-L. (2002) Statistical mechanics of complex networks. Review of Modern Physics 74:47-97. PDF
- Newman, M.E.J. (2003) The structure and function of complex networks. SIAM Review 45:167-256. PDF
