The clustering coefficient of graphs

The clustering coefficient of a node or a vertex in a graph depends on how close the neighbors are so that they form a clique (or a small complete graph), as shown in the following diagram:

The clustering coefficient of graphs

There is a well known formula to cluster coefficients, which looks pretty heavy with mathematical symbols. However, to put it in simple words, take a look at the following equation:

The clustering coefficient of graphs

This involves keeping track of the links at every vertex and calculating the clustering index at every vertex, where the neighbor of a node in the ...

Get Mastering Python Data Visualization now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.