Perform the rich club connectivity of a graph.
[RCC] = NARVAL_G_RichClubConnect(g)
graph.
rich club connectivity.
NARVAL_G_RichClubConnect performs the Rich Club Connectivity RCC of the graph g. For each value of ρ between 2 and the total number of nodes of the graph n, the first ρ nodes ordererd by their non-increasing degrees are extracted. RCC is the ratio of the number of links in the subgraph induced by the ρ largest-degree nodes to the maximum possible links ρ*(ρ-1)/2. RCC is a measure of how close ρ-induced subgraphs are to cliques.
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;//window index [f]=NARVAL_G_ShowGraph(g,ind);//graph visualization [RCC]=NARVAL_G_RichClubConnect(g);//application of NARVAL_G_RichClubConnect scf(2);//graph visualization clf(2); f=gcf(); f.figure_name="NARVAL_G_RichClubConnect"; plot2d3(2:g.node_number,RCC); plot2d(2:g.node_number,RCC,style=5); xtitle('Rich Club Connectivity','',''); | ![]() | ![]() |
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346