Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Small worlds

Small worlds Small world models are networks consisting of many local links and fewer long range ‘shortcuts’. In this paper, we consider some particular instances, and rigorously investigate the distribution of their inter‐point network distances. Our results are framed in terms of approximations, whose accuracy increases with the size of the network. We also give some insight into how the reduction in typical inter‐point distances occasioned by the presence of shortcuts is related to the dimension of the underlying space. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19, 54–74, 2001 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Random Structures and Algorithms Wiley

 
/lp/wiley/small-worlds-Ia8baSHQ4R

References (10)

Publisher
Wiley
Copyright
Copyright © 2001 John Wiley & Sons, Inc.
ISSN
1042-9832
eISSN
1098-2418
DOI
10.1002/rsa.1018
Publisher site
See Article on Publisher Site

Abstract

Small world models are networks consisting of many local links and fewer long range ‘shortcuts’. In this paper, we consider some particular instances, and rigorously investigate the distribution of their inter‐point network distances. Our results are framed in terms of approximations, whose accuracy increases with the size of the network. We also give some insight into how the reduction in typical inter‐point distances occasioned by the presence of shortcuts is related to the dimension of the underlying space. © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 19, 54–74, 2001

Journal

Random Structures and AlgorithmsWiley

Published: Aug 1, 2001

There are no references for this article.