Abstract
We study the distribution function for minimal paths in small-world networks. We derive its general form, which we verify numerically, and also discuss its scaling properties. Using the general form of this distribution function, we derive exact expressions for the average minimal distance and its variance Finally, we study the limit of large system sizes and obtain some approximate results.
- Received 19 August 1999
DOI:https://doi.org/10.1103/PhysRevE.61.4268
©2000 American Physical Society