Perform the Joint Degree Distribution of a graph.
[Jn] = NARVAL_G_JDD(h,t,d,m,w)
vector composed by the head node of each network edge.
vector composed by the tail node of each network edge.
node degree vector.
limit node degree used for the display.
window index.
Joint Degree Distribution.
NARVAL_G_JDD 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 M(k1,k2) be the total quantity of edges connecting nodes of degrees k1 and k2. JDD stored into the matrix Jn provides the probability that a randomly selected edge connects k1 and k2-degree nodes. Jn 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]=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);//all degrees are displayed w=2;//window index Jn=NARVAL_G_JDD(g.name,g.head,g.tail,dv,m,w);//application of NARVAL_G_JDD Jn | ![]() | ![]() |
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