Of Notes
Triangles and the Clustering Coefficient
Table of Contents
We observe in a network that the number of paths between
With this in mind, we now think of a length equal to
Taking into account that one path can be traversed there and back we express the triangle count:
Clusters
We abstract the notion of two neighbors being connected to a clustering coefficient
Formally,
Here the Kronecker Delta Function
Simplified Simple Non Directed Graph
For a set of neighbors, the total number of connections is: a single neighbor can connect to
Therefore:
Or also writable as: