path length
The shortest number of steps (links) needed to get from one node in a network to another; averaged over all pairs gives the average path length.
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 “path length” →
- Worlds do not have to be small: a checkerboard or ring world of 10 billion people who each know only their nearest neighbors would have on the order of 100,000 degrees of separation, demonstrating that the small-world property is a non-trivial feature requiring explanation rather than a given.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