<< NL_G_MaximumNodeDegree NL_G: Graph NL_G_NodeClose2XY >>

NARVAL >> NL_G: Graph > NL_G_MeanLocalClustering

NL_G_MeanLocalClustering

Perform the mean local clustering of a graph.

Calling Sequence

[M] = NARVAL_G_MeanLocalClustering(G)

Arguments

G :

Graph.

M :

Mean local clustering.

Description

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).

Examples

n=300;//network size
l0=5;//a maximum of 5 links are created for each new node
L=1000;//network square area side 
[g,dd]=NL_T_BarabasiAlbert(n,l0,L);//generation of the topology
ind=1;//window index
[f]=NL_G_ShowGraph(g,ind);//graph visualization
[MLC]=NL_G_MeanLocalClustering(g)//application of NL_G_MeanLocalClustering

Dependency

NL_G_GraphDegreeDist, NL_G_LocalClustering

Report an issue
<< NL_G_MaximumNodeDegree NL_G: Graph NL_G_NodeClose2XY >>