復(fù)雜網(wǎng)絡(luò)聚類系數(shù)和平均路徑長度計(jì)算的matlab源代碼-文庫吧
2025-07-21 04:36 本頁面
【正文】 0。 = gMatrix(neighbor, neighbor)。 if(Num 1), Cp_Nodal(i) = sum(temp(:))/Num/(Num1)。 end end case 39。WEIGHTED39。% Weighted network arithmetic mean for i = 1:N neighbor = (gMatrix(i,:) 0)。 n_weight = gMatrix(i,neighbor)。 Si = sum(n_weight)。 Num = sum(neighbor)。 if(Num 1), n_weight = ones(Num,1)*n_weight。 n_weight = n_weight + n_weight39。 n_weight = n_weight.*(gMatrix(neighbor, neighbor) 0)。 Cp_Nodal(i) = sum(n_weight(:))/(2*Si*(Num1))。 endend %case 39。WEIGHTED39。% Weighted network geometric mean%A = (gMatrix~= 0)。%G3 = diag((gMatrix.^(1/3) )^3)。)%A(A == 0) = inf。 %closetriplet no exist,let CpNode=0 (A=inf)%CpNode = G3./(A.*(A1))。case 39。DIRECTED39。, % Directed networkfor i = 1:N inset = (gMatrix(:,i) 0)。 %innodes set outset = (gMatrix(i,:) 0)39。 %outnodes set if(any(inset amp。 outset)) allset = and(inset, outset)。 % Ensure aji*aik 0,j belongs to inset,and k belongs to outset total = sum(inset)*sum(outset) sum(allset)。 tri = sum(sum(gMatrix(inset, outset)))。 Cp_Nodal(i) = tri./total。 end end %case 39。DIRECTED39。, % Directed network clarity format (from Mika Rubinov, UNSW)%G = gMatrix + gMatrix39。 %symmetrized%D = sum(G,2)。 %total degree%g3 = diag(G^3)/2。16
范文總結(jié)相關(guān)推薦
鄂ICP備17016276號-1