Knowing a network by walking on it: emergence of scaling
arXiv:cond-mat/0006132
Abstract
A model for growing networks is introduced, having as a main ingredient that new nodes are attached to the network through one existing node and then explore the network through the links of the visited nodes. From exact calculations of two limiting cases and numerical simulations the phase diagram of the model is obtained. In the stationary limit, large network sizes, a phase transition from a network with finite average connectivity to a network with a power law distribution of connectivities, with no finite average, is found. Results are compared with measurements on real networks.
arXiv commentRevTex, 4 pages, 3 ps figs, new exact calculations and more numerical results
Cited by in corpus (15)
- Statistical mechanics of complex networks
- Evolution of networks
- Spectra of "Real-World" Graphs: Beyond the Semi-Circle Law
- Scale Free Networks from Self-Organisation
- Exact Solution for the Time Evolution of Network Rewiring Models
- The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter
- Modelling Citation Networks
- Complex Networks
- Accelerating, hyper-accelerating, and decelerating probabilistic networks
- Binding Social and Cultural Networks: A Model
- A Generative Model of Software Dependency Graphs to Better Understand Software Evolution
- Exact Solutions for Models of Cultural Transmission and Network Rewiring
- An introduction to the theory of citing
- Peer-review in the Internet age
- Scale-Invariant Strength Assortativity of Streaming Butterflies