×

Small worlds. (English) Zbl 0988.60100

Consider a circle \(C\) of circumference 1 and a Poisson process of intensity \(n\) on \(C\). From each of its points a random chord is drawn to a uniformly distributed point. These chords we call “shortcuts” and let them all have “length” 0. A “small worlds” network is created with local links and long range shortcuts. Let \(D\) be the distance between two random points on \(C\) using arcs and shortcuts. One result proved in this nice paper is the convergence of \(nD - (1/4)\log n\) to a certain non-degenerate distribution as \(n\) tends to infinity; the same result holds if the number of chords is \(n\) (non-random). Also higher-dimensional results are derived. Models of this type have recently received considerable attention and have been investigated by physicists in heuristic ways, giving in some cases non-correct results, contrary to the rigorous and interesting methods of the present paper.

MSC:

60K99 Special processes

References:

[1] Ball, Ann Appl Probab 7 pp 46– (1997) · Zbl 0909.92028 · doi:10.1214/aoap/1034625252
[2] and Poisson Approximation, Oxford Science Publications, Oxford, 1992.
[3] Barrat, Europhys J B 13 pp 547– (2000)
[4] Random Graphs, Academic Press, London, 1985.
[5] Moore, Phys Rev E 61 pp 5678– (2000) · doi:10.1103/PhysRevE.61.5678
[6] Newman, Phys Rev E 60 pp 7332– (1999) · doi:10.1103/PhysRevE.60.7332
[7] Newman, Phys Rev Lett 84 pp 3201– (2000) · doi:10.1103/PhysRevLett.84.3201
[8] Stochastic Processes, 2nd edition, Wiley, New York, 1996.
[9] Small Worlds, Princeton University Press, Princeton, NJ, 1999.
[10] Watts, Nature 393 pp 440– (1998) · Zbl 1368.05139 · doi:10.1038/30918
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.