Perform the mean local clustering of a graph.
[M] = NARVAL_G_MeanLocalClustering(G)
Graph.
Mean local clustering.
NL_G_MeanLocalClustering performs the mean local clustering M of the graph G. If is the average number of links between the neighbors of k-degree nodes, the local clustering C is the ratio of this number to the maximum possible such links:
. If two neighbors of a node are connected, then these three nodes form together 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 (WIKIPEDIA).