<< NARVAL_G_LongueurArc NARVAL NARVAL_G_MakeGraph >>

NARVAL >> NARVAL > NARVAL_G_MLClustering

NARVAL_G_MLClustering

Perform the mean local clustering of a graph.

Calling Sequence

[MLC]=NARVAL_G_MLClustering(g)

Parameters

g :

graph.

MLC :

mean local clustering.

Description

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.

Examples

n=300;//network size
l0=5;//a maximum of 5 links are created for any created node
L=1000;//network square area side 
[g,dd]=NARVAL_T_BarabasiAlbert(n,l0,L);//generation of the topology
ind=1;
[f]=NARVAL_G_ShowGraph(g,ind);
[MLC]=NARVAL_G_MLClustering(g);//application of NARVAL_G_MLClustering
MLC

Dependency

NARVAL_G_GraphDegDistWD, NARVAL_G_LocalClustering

Author

http://wwwen.uni.lu/interdisciplinary_centre_for_security_reliability_and_trust

Contact

<< NARVAL_G_LongueurArc NARVAL NARVAL_G_MakeGraph >>