Perform the Average Neighbor Connectivity of a graph node (degree K).
[A] = NL_G_AvgNConnectivity(J,K)
Joint degree distribution.
Node degree.
Average neighbor Connectivity.
NL_G_AvgNConnectivity performs the Average Neighbor Connectivity A of the graph node of 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. with
.
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]=NL_T_BarabasiAlbert(n,l0,L);//generation of the topology ind=1;//window index [f]=NL_G_ShowGraph(g,ind);//graph visualization [d,dv]=NL_G_GraphDegreeDist(g);//extraction of the node degree distribution m=max(dv);//maximum degree w=2;//window index Jn=NL_G_JointDegreeDist(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]=NL_G_AvgNConnectivity(Jn,i);//application of NL_G_AvgNConnectivity if (ANC <> []) ANCi=[ANCi i]; ANCv=[ANCv ANC]; end end [ANCi;ANCv] | ![]() | ![]() |