In graph theory, a clustering coefficient is a measure of the d... - dofaq.co
clustering coefficient

In graph theory, a clustering coefficient is a measure of the d...

wikipedia - 07 Oct 2015
In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social networks, nodes tend to create tightly knit groups characterised by a relatively high density of ties; this likelihood tends to be greater than the average probability of a tie randomly established between two nodes (Holland and Leinhardt, 1971; Watts and Strogatz, 1998).

What's New