Perform the mean local clustering of a graph.
[MLC]=NARVAL_G_MLClustering(g)
graph.
mean local clustering.
NARVAL_G_MLClustering performs the mean local clustering MLC of the graph g. If mnn(k) is the average number of links between the neighbors of k-degree nodes, the local clustering LC is the ratio of this number to the maximum possible such links: LC(k)=2*mnn(k)/(k*(k-1)). If two neighbors of a node are connected, then these three nodes together form a triangle (3-cycle). Thus the local clustering corresponds to the average number of 3-cycles involving k-degree nodes. The mean local clustering is the average value of the local clustering.