Perform the Joint Degree Distribution of a graph.
[J] = NL_G_JointDegreeDist(N,H,T,D,M,W)
Graph name.
Head vector.
Tail vector.
Node degree vector.
Limit node degree used for the display.
Window index.
Joint degree distribution.
NL_G_JointDegreeDist performs the Joint Degree Distribution of the graph G characterized by the head H and tail T vectors of its edges. The vector composed by the degree of each network node is assumed to be stored in D. Let be the total quantity of edges connecting nodes of degrees
and
. JDD stored into the matrix J provides the probability that a randomly selected edge connects
and
-degree nodes. J is displayed within the window W. M corresponds to the limit node degree used in the display.
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 [d,dv]=NL_G_GraphDegreeDist(g);//extraction of the node degree distribution m=max(dv);//all degrees are displayed w=2;//window index Jn=NL_G_JointDegreeDist(g.name,g.head,g.tail,dv,m,w)//application of NL_G_JointDegreeDist | ![]() | ![]() |