Small worlds
By A. Barbour, Gesine Reinert. Random Struct. Algorithms, 2000
935 citations recorded by the source corpus.
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
Subfields: Condensed Matter Physics, Mathematical Physics, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/22e84d145fef748ce9bd0737318717d9720a7b15
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Condensed Matter Physics
In Mathematical Physics
- Mark Newman
- Mark S. Handcock
- Gregory Kossinets
- Òscar Celma
- R. Durrett
- Bryan Perozzi
- Raphael Heiko Heiberger
- Duncan J. Watts
In Statistical and Nonlinear Physics
- Huan Liu
- Lei Tang
- Santo Fortunato
- Adrian E. Raftery
- Mark S. Handcock
- Carter T. Butts
- Jure Leskovec
- Jeremy Tantrum
Citations in the corpus
- The Structure and Function of Complex Networks (2003, methodology): “and Barbour and Reinert [38] have further shown that this result is the leading order term in an expansion for that can be used to derive more accurate results for f(x).”