# 1 Loglog plot of 𝑛^∗ vs 𝑝 for system sizes up to 5500 and for 𝑧=2, 4. Note that the curvature of 𝑛^∗⁢(𝑝) in the loglog plot, which gives us a local estimate of 𝜏, is increasing as 𝑝 decreases. In the inset, we show that 𝜏 approaches 1 as 𝑝→0. Our new estimate of 𝜏 is 0.97±0.05, consistent with the value 1 given by a simple scaling argument.

Erratum: Small-world networks: Evidence for a crossover picture

\[Phys. Rev. Lett. 82, 3180 (1999)\]

Marc Barthélémy and Luís A. Nunes Amaral

We have performed new calculations using the breadth-first search algorithm . We are now able to study systems with sizes up to $`n=5500`$. As shown in Fig. 1, we now find $`\tau 1`$, in agreement with the simple argument given in our Letter but different from the originally reported numerical result ($`\tau =0.67\pm 0.10`$). The reason for the incorrect numerical result reported initially is the small system sizes we studied, which did not allow us to reach the asymptotic regime.

We thank M.E.J. Newman and D.J. Watts  and A. Barrat  for alerting us to the possibility of an error on our estimate of $`\tau `$. We also thank M. Argollo de Menezes for directing us to the breadth-first search algorithm.

 J. van Leeuwen, Ed., Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity (Elsevier, Amsterdam, 1990), p. 539.

 We found the LEDA libraries very useful and efficient \[http://www.mpi-sb.mpg.de/LEDA/leda.html\].

 M.E.J. Newman and D.J. Watts, cond-mat/9903357.

 A. Barrat, cond-mat/9903323; A. Barrat and M. Weigt, cond-mat/9903411.