Average Path Length

Jeremy Guillette edited this page Mar 6, 2016 · 2 revisions
Clone this wiki locally

The average graph-distance between all pairs of nodes.

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

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

Additional Reading