Perform the Average Neighbor Connectivity of a graph node with degree k.
[ANC] = NARVAL_G_AvgNeighborConn(JDD,k)
Joint Degree Distribution.
node degree.
Average Neighbor Connectivity.
NARVAL_G_AvgNeighborConn performs the Average Neighbor Connectivity ANC of the graph node with degree k. It is a summary statistic of the Joint Degree Distribution. It corresponds to the average neighbor degree of the average k-degree node. ANC(k)={Σ k'=1..kmax} k'P(k'|k) with P(k2|k1)=k_bar /k1*JDD(k1,k2)/P(k1). k_bar is the average node degree.
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]=NARVAL_T_BarabasiAlbert(n,l0,L);//generation of the topology ind=1;//window index [f]=NARVAL_G_ShowGraph(g,ind);//graph visualization [d,dv]=NARVAL_G_GraphDegDistWD(g);//extraction of the node degree distribution m=max(dv);//maximum degree w=2;//window index Jn=NARVAL_G_JDD(g.name,g.head,g.tail,dv,m,w);//performance of JDD [a b]=size(Jn); kmax=a; ANCv=[]; ANCi=[]; for i=1:kmax [ANC]=NARVAL_G_AvgNeighborConn(Jn,i);//application of NARVAL_G_AvgNeighborConn if (ANC <> []) ANCi=[ANCi i]; ANCv=[ANCv ANC]; end end [ANCi;ANCv] | ![]() | ![]() |
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