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

复杂网络聚类系数和平均路径长度计算的MATLAB源代码 申明：文章来自百度用户carrot_hy 复杂网络的代码总共是三个m文件，复制如下： 第一个文件，CCM_ClusteringCoef.m function [Cp_Global, Cp_Nodal] = CCM_ClusteringCoef(gMatrix, Types)% CCM_ClusteringCoef calculates clustering coefficients.% Input:%?? gMatrix???? adjacency matrix%?? Types?????? type of graph: binary,weighted,directed,all(default).% Usage:%?? [Cp_Global, Cp_Nodal] = CCM_ClusteringCoef(gMatrix, Types) returns%?? clustering coefficients for all nodes Cp_Nodal and average clustering%?? coefficient of network Cp_Global.% Example:%?? G = CCM_TestGraph1(nograph);%?? [Cp_Global, Cp_Nodal] = CCM_ClusteringCoef(G);% Note:%?? 1) one node have vaule 0, while which only has a neighbour or none.%?? 2) The dircted network termed triplets that fulfill the follow condition %????? as non-vacuous: j-i-k and k-i-j,if dont satisfy with that as %????? vacuous, just like: j-i,k-i and i-j,i-k. and the closed triplets%????? only j-i-k == j-k and k-i-j == k-j.%?? 3) ALL type network code from Mika Rubinovs BCT toolkit.% Refer:%? [1] Barrat et al. (2004) The architecture of the complex weighted networks. %? [2] Wasserman,S.,Faust,K.(1994) Social Network Analysis: Methods and%????? Applications.%? [3] Tore Opsahl and Pietro Panzarasa (2009). Clustering in Weighted %????? Networks. Social Networks31(2).% See also CCM_Transitivity % 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?gMatrix = double(gMatrix 0);%Ensure binary network?for i = 1:N??????? neighbor = (gMatrix(i,:) 0);??????? Num????? = sum(neig