I've found code online to find the clustering coefficients from the adjacency matrix, and i'm trying to understand how it works. So deg and cn are column vectors, but i don't understand what cn(deg>1) or deg(deg>1) actually means. thanks

Question

Joe Choong 2018-4-7

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/393295-i-ve-found-code-online-to-find-the-clustering-coefficients-from-the-adjacency-matrix-and-i-m-trying

回答： Arun Mathamkode 2018-4-20

deg = sum(graph, 2); %Determine node degrees cn = diag(graph*triu(graph)*graph); %Number of triangles for each node

%The local clustering coefficient of each node c = zeros(size(deg)); c(deg > 1) = 2 * cn(deg > 1) ./ (deg(deg > 1).*(deg(deg > 1) - 1));

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Arun Mathamkode 2018-4-20

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/393295-i-ve-found-code-online-to-find-the-clustering-coefficients-from-the-adjacency-matrix-and-i-m-trying#answer_316126

This is basically logical indexing. deg>1 returns a logical matrix of size deg with value 1 at coordinates where deg>1 condition is satisfied. This logical matrix then can be used for logical indexing. You refer the following blog for more details.

https://blogs.mathworks.com/loren/2013/02/20/logical-indexing-multiple-conditions/