Discrete small world networks

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.

[1]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[2]  F. Ball,et al.  Epidemics with two levels of mixing , 1997 .

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Svante Janson,et al.  One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights , 1999, Combinatorics, Probability and Computing.

[5]  M. Newman,et al.  Scaling and percolation in the small-world network model. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[6]  M. Newman,et al.  Epidemics and percolation in small-world networks. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[7]  Ron Goldman,et al.  Poisson approximation , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[8]  M. Newman,et al.  Mean-field solution of the small-world network model. , 1999, Physical review letters.

[9]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[10]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[11]  Joao Antonio Pereira,et al.  Linked: The new science of networks , 2002 .

[12]  Maximino Aldana-Gonzalez,et al.  Linked: The New Science of Networks , 2003 .

[13]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .