资源描述:
《复杂网络聚类系数和平均路径长度计算的MATLAB源代码》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库。
1、复杂网络聚类系数和平均路径长度计算的MATLAB源代码申明:文章来自百度用户carrot_hy复杂网络的代码总共是三个m文件,复制如下:第一个文件,CCM_ClusteringCoef.mfunction[Cp_Global,Cp_Nodal]=CCM_ClusteringCoef(gMatrix,Types)%CCM_ClusteringCoefcalculatesclusteringcoefficients.%Input:% gMatrix adjacencymatrix% Types typeofgraph:'binary','weighted','direct
2、ed','all'(default).%Usage:% [Cp_Global,Cp_Nodal]=CCM_ClusteringCoef(gMatrix,Types)returns% clusteringcoefficientsforallnodes"Cp_Nodal"andaverageclustering% coefficientofnetwork"Cp_Global".%Example:% G=CCM_TestGraph1('nograph');% [Cp_Global,Cp_Nodal]=CCM_ClusteringCoef(G);%Note:% 1)onenodeha
3、vevaule0,whilewhichonlyhasaneighbourornone.% 2)Thedirctednetworktermedtripletsthatfulfillthefollowcondition% asnon-vacuous:j->i->kandk->i-j,ifdon'tsatisfywiththatas% vacuous,justlike:j->i,k->iandi->j,i->k.andtheclosedtriplets% onlyj->i->k==j->kandk->i->j==k->j.% 3)'ALL'typenetworkco
4、defromMikaRubinov'sBCTtoolkit.%Refer:% [1]Barratetal.(2004)Thearchitectureofthecomplexweightednetworks.% [2]Wasserman,S.,Faust,K.(1994)SocialNetworkAnalysis:Methodsand% Applications.% [3]ToreOpsahlandPietroPanzarasa(2009)."ClusteringinWeighted% Networks".SocialNetworks31(2).%SeealsoCCM_Tr
5、ansitivity%WrittenbyYongLiu,Oct,2007%CenterforComputationalMedicine(CCM),%NationalLaboratoryofPatternRecognition(NLPR),%InstituteofAutomation,ChineseAcademyofSciences(IACAS),China.%RevisebyHuYong,Nov,2010%E-mail:%basedonMatlab2006a%$Revision:1.0,Copywrite(c)2007error(nargchk(1,2,nargin,'struct'))
6、;if(nargin<2), Types='all'; endN=length(gMatrix);gMatrix(1:(N+1):end)=0;%Clearself-edgesCp_Nodal=zeros(N,1); %Preallocateswitch(upper(Types))case'BINARY'%Binarynetwork gMatrix=double(gMatrix>0);%Ensurebinarynetwork fori=1:N neighbor=(gMatrix(i,:)>0); Num =sum(neighbor);%number
7、ofneighbornodes temp =gMatrix(neighbor,neighbor); if(Num>1), Cp_Nodal(i)=sum(temp(:))/Num/(Num-1); end end case'WEIGHTED'%Weightednetwork--arithmeticmean fori=1:N neighbor=(gMatrix(i,:)>0);