Small-world networks describe mathematically many natural and man-made networks such as neurons, power grids or social networks, but a measure of how small a small-world network is, remains a subject of debate. The authors identify the limiting cases with the shortest and longest average path for a given number of nodes and edges, which can be used as benchmarks to evaluate the average shortest path length for both empirical and model networks.
- Gorka Zamora-López
- Romain Brasselet