Key points are not available for this paper at this time.
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 sigma(2). Finally, we study the limit of large system sizes and obtain some approximate results.
Kulkarni et al. (Sat,) studied this question.