paper

Exactly solvable analogy of small-world networks

arXiv:cond-mat/9907445 · doi:10.1209/epl/i2000-00227-1

Abstract

We present an exact description of a crossover between two different regimes of simple analogies of small-world networks. Each of the sites chosen with a probability from sites of an ordered system defined on a circle is connected to all other sites selected in such a way. Every link is of a unit length. Thus, while changes from 0 to 1, an averaged shortest distance between a pair of sites changes from to . We find the distribution of the shortest distances and obtain a scaling form of . In spite of the simplicity of the models under consideration, the results appear to be surprisingly close to those obtained numerically for usual small-world networks.

4 pages with 3 postscript figures

References in corpus (6)

Cited by in corpus (37)