<< NL_G_RandCoordinates NL_G: Graph NL_G_SaveGraph >>

NARVAL >> NL_G: Graph > NL_G_RichClubConnect

NL_G_RichClubConnect

Perform the rich club connectivity of a graph.

Calling Sequence

[R] = NL_G_RichClubConnect(G)

Arguments

G :

Graph.

R :

Rich club connectivity.

Description

NL_G_RichClubConnect performs the Rich Club Connectivity R of the graph G. For each value of between 2 and the total number of nodes of the graph n, the first nodes ordered by their non-increasing degrees are extracted. R is the ratio of the number of links in the subgraph induced by the largest-degree nodes to the maximum possible links . R is a measure of how close -induced subgraphs are to cliques.

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]=NL_T_BarabasiAlbert(n,l0,L);//generation of the topology
ind=1;//window index
[f]=NL_G_ShowGraph(g,ind);//graph visualization
[RCC]=NL_G_RichClubConnect(g)//application of NL_G_RichClubConnect
scf(2);//graph visualization
clf(2);
f=gcf();
f.figure_name="NL_G_RichClubConnect";
plot2d3(2:g.node_number,RCC);
plot2d(2:g.node_number,RCC,style=5);
xtitle('Rich Club Connectivity','','');

Dependency

NL_G_GraphDegreeDist, NL_G_DeleteNodes

Report an issue
<< NL_G_RandCoordinates NL_G: Graph NL_G_SaveGraph >>