Characteristic path length, global and local efficiency, and clustering coefficient of a graph

Versione 1.2.0.0 (2,78 KB) da Nathan Cahill
Computes various graph-theoretic properties related to network connectivity
4.0
(2)
2,2K download
Aggiornato 30 ago 2015

Visualizza la licenza

This code implements the graph-theoretic properties discussed in the papers:
A) N.D. Cahill, J. Lind, and D.A. Narayan, "Measuring Brain Connectivity," Bulletin of the Institute of Combinatorics & Its Applications, 69, pp. 68-78, September 2013. (Available online: http://people.rit.edu/ndcsma/pubs/BICA_Sept_2013.pdf)

B) B. Ek, C. VerSchneider, N.D. Cahill, and D.A. Narayan, "A Comprehensive Comparison of Graph Theory Metrics for Social Networks," Social Network Analysis and Mining, 5(1), pp. 1-7, July 2015.

A script is provided that shows how to compute the graph-theoretic properties for the exercises described in these papers.

Cita come

Nathan Cahill (2025). Characteristic path length, global and local efficiency, and clustering coefficient of a graph (https://it.mathworks.com/matlabcentral/fileexchange/46084-characteristic-path-length-global-and-local-efficiency-and-clustering-coefficient-of-a-graph), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2013b
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Tag Aggiungi tag

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
1.2.0.0

updated citation
1.1.0.0

Added both closed and open versions of clustering coefficient and local efficiency, and expanded the set of examples in exampleScript.m.
1.0.0.0