clustering coefficient
The probability, between 0 and 1, that two randomly chosen friends of yours are also friends with each other; a measure of local interconnectedness.
As defined in 41 | Steven Strogatz on Synchronization, Networks, and the Emergence of Complex Behavior
Where it comes up · 1
Most important claims · 2 of 2Search all claims for “clustering coefficient” →
- The naive calculation of degrees of separation (if I know 100 people and each knows 100 others, the world collapses to a handful of steps) fails because of clustering: the people my friends know heavily overlap with the people I know, since we live near each other or share a profession, so the simple multiplication massively overcounts reach.41 | Steven Strogatz on Synchronization, Networks, and the Emergence of Complex Behavior
- Real-world networks are paradoxically both highly clustered (most of your friends know each other, unlike a random network) and 'small' in path length (almost as small as a random network), and the central question Watts and Strogatz solved was how a network could simultaneously possess both properties.41 | Steven Strogatz on Synchronization, Networks, and the Emergence of Complex Behavior