@article{EJP381,
author = {Andrew Barbour and Gesine Reinert},
title = {Discrete small world networks},
journal = {Electron. J. Probab.},
fjournal = {Electronic Journal of Probability},
volume = {11},
year = {2006},
keywords = {Small-world networks, shortest path length, branching process},
abstract = {Small world models are networks consisting of many local links and fewer long range `shortcuts', used to model networks with a high degree of local clustering but relatively small diameter. Here, we concern ourselves with the distribution of typical inter-point network distances. We establish approximations to the distribution of the graph distance in a discrete ring network with extra random links, and compare the results to those for simpler models, in which the extra links have zero length and the ring is continuous.},
pages = {no. 47, 1234-1283},
issn = {1083-6489},
doi = {10.1214/EJP.v11-381},
url = {http://ejp.ejpecp.org/article/view/381}}