**Summary:** This paper investigates small-world networks, which are graphs with many local connections and a few long-range shortcuts. The authors analyze the distribution of distances between nodes in such networks, focusing on the "characteristic path length" and "clustering coefficient." They consider a continuous model on a circle with randomly added shortcuts, and derive approximations for the distance distribution. The analysis shows that the presence of shortcuts significantly reduces typical distances, especially in one dimension. The results are extended to higher dimensions, where the reduction in distance is less pronounced. The paper also compares the results with the heuristic approach proposed by Newman, Moore, and Watts, and provides rigorous proofs for the distributional approximations. The key findings include that the expected distance scales with the number of shortcuts and the size of the network, and that the distribution of distances can be approximated using Poisson processes. The study highlights the importance of shortcuts in reducing the effective distance between nodes in small-world networks.**Summary:** This paper investigates small-world networks, which are graphs with many local connections and a few long-range shortcuts. The authors analyze the distribution of distances between nodes in such networks, focusing on the "characteristic path length" and "clustering coefficient." They consider a continuous model on a circle with randomly added shortcuts, and derive approximations for the distance distribution. The analysis shows that the presence of shortcuts significantly reduces typical distances, especially in one dimension. The results are extended to higher dimensions, where the reduction in distance is less pronounced. The paper also compares the results with the heuristic approach proposed by Newman, Moore, and Watts, and provides rigorous proofs for the distributional approximations. The key findings include that the expected distance scales with the number of shortcuts and the size of the network, and that the distribution of distances can be approximated using Poisson processes. The study highlights the importance of shortcuts in reducing the effective distance between nodes in small-world networks.