Talk:Clustering coefficient

From Wikipedia, the free encyclopedia

You have new messages (last change).

Duno is this is the right place to discuss about this but it seems like there is an error on this page. According to other websites and research papers, the maximum of links within the neighbourhood in a directed graph is k_i(k_i-1), not 2k_i(k_i-1).

One of the sources : http://www.elvis.ac.nz/brain?ClusteringCoefficient

It is indeed the correct place to discuss it. It was indeed incorrect, I've changed it. Thank you for your correction. --stochata 16:55, 1 Mar 2005 (UTC)

p.s., do not be afraid to be bold and correct it yourself!

Added a few wikilinks to explore for us aspiring math dummies out there. ^^ Zanturaeon 23:21, August 1, 2005 (UTC)

Isn't N_i = \{v_j\} : e_{ij} \in E. problematic if eij is eii an edge leading to the vertex whrer it starts?

Retrieved from "http://en.wikipedia.org../../../c/l/u/Talk%7EClustering_coefficient_812d.html"