复杂网络聚类系数和平均路径长度计算的MATLAB源代码.docVIP

复杂网络聚类系数和平均路径长度计算的MATLAB源代码 % Written by Yong Liu, Oct,2007% Center for Computational Medicine (CCM),% National Laboratory of Pattern Recognition (NLPR),% Institute of Automation,Chinese Academy of Sciences (IACAS), China.% Revise by Hu Yong, Nov, 2010 % E-mail: % based on Matlab 2006a% $Revision: 1.0, Copywrite (c) 2007 error(nargchk(1,2,nargin,struct));if(nargin 2),牋?Types = all;牋 end,% N = length(gMatrix);gMatrix(1:(N+1):end) = 0;%Clear self-edges Cp_Nodal = zeros(N,1);牋 %Preallocateswitch(upper(Types))case BINARY%Binary network爂Matrix = double(gMatrix 0);%Ensure binary network爁or i = 1:N牋牋牋?neighbor = (gMatrix(i,:) 0);牋牋牋?Num牋牋?= sum(neighbor);%number of neighbor nodes牋?牋牋 temp牋牋 = gMatrix(neighbor, neighbor);牋牋牋?if(Num 1),?Cp_Nodal(i) = sum(temp(:))/Num/(Num-1);牋 end牋?end牋?case WEIGHTED% 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_weight;牋牋牋牋牋?n_weight?= n_weight.*(gMatrix(neighbor, neighbor) 0);牋牋牋牋牋?Cp_Nodal(i) = sum(n_weight(:))/(2*Si*(Num-1));牋牋牋?end爀nd牋牋牋?%case WEIGHTED% Weighted network -- geometric mean%燗?= (gMatrix~= 0);%燝3 = diag((gMatrix.^(1/3) )^3);)%燗(A == 0) = inf;?%close-triplet no exist,let CpNode=0 (A=inf)%燙pNode = G3./(A.*(A-1)); case DIRECTED, % Directed network爁or i = 1:N牋牋牋?inset牋 = (gMatrix(:,i) 0);?%in-nodes set牋牋牋?outset?= (gMatrix(i,:) 0); %out-nodes set牋牋牋?if(any(inset outset))牋牋牋牋牋?allset = and(inset, outset);牋牋牋牋牋?% Ensure aji*aihbor nodes牋?k 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 DIRECTED, % Dire