The clustering coefficient is a measure used in network theory to quantify the degree to which nodes in a graph tend to cluster together. It provides a way to understand the local structure of a network. There are two main types of clustering coefficients: the local clustering coefficient and the global clustering coefficient.
Articles by others on the same topic
For a vertex with neighbours in a simple graph, its local clustering coefficient is , where counts edges among those neighbours. It is the fraction of possible neighbour-neighbour edges that are present. A common network summary averages these local coefficients, setting them to zero for degrees below two; this differs from weighting by the number of neighbour pairs.