Dynamic Clustering Coefficient Algorithm

Algorithm calculating the dynamic clustering coefficient of a dynamic network

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.