12345678910111213141516171819202122232425262728 |
- function C=clustering_coef_bu(G)
- %CLUSTERING_COEF_BU Clustering coefficient
- %
- % C = clustering_coef_bu(A);
- %
- % The clustering coefficient is the fraction of triangles around a node
- % (equiv. the fraction of node's neighbors that are neighbors of each other).
- %
- % Input: A, binary undirected connection matrix
- %
- % Output: C, clustering coefficient vector
- %
- % Reference: Watts and Strogatz (1998) Nature 393:440-442.
- %
- %
- % Mika Rubinov, UNSW, 2007-2010
- n=length(G);
- C=zeros(n,1);
- for u=1:n
- V=find(G(u,:));
- k=length(V);
- if k>=2 %degree must be at least 2
- S=G(V,V);
- C(u)=sum(S(:))/(k^2-k);
- end
- end
|