Dynamic Clustering Coefficient Algorithm

Version 1.1.0.0 (1.58 KB) by Anh-Dung Nguyen
Algorithm calculating the dynamic clustering coefficient of a dynamic network
1.0
(1)
681 Downloads
Updated 7 Jan 2013

View License

This function calculates the dynamic clustering coefficient of a dynamic network defined in the
paper "Understanding and Modeling the Small-World Phenomenon in Dynamic Networks - AD. Nguyen et al. - MSWIM 2012"

Inputs:
- trace: a 3D-matrix in which the 1st and 2nd dimension correspond to node's IDs and the 3rd dimension corresponds to the time. trace(:,:,t) is the network adjacency matrix at time t (i.e. trace(i,j,t) = 1 if i is connected to j at time t and 0 otherwise). trace(i,i,t) is 1 for all i.

Outputs:
- c: the average dynamic clustering coefficient of the network.

Cite As

Anh-Dung Nguyen (2024). Dynamic Clustering Coefficient Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/39740-dynamic-clustering-coefficient-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2010a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Networks in Help Center and MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Published Release Notes
1.1.0.0

description modified
1.0.0.0