Minimal models of weighted scale-free networks
arXiv:cond-mat/0408343
Abstract
We consider a class of simple, non-trivial models of evolving weighted scale-free networks. The network evolution in these models is determined by attachment of new vertices to ends of preferentially chosen weighted edges. Resulting networks have scale-free distributions of the edge weight, of the vertex degree, and of the vertex strength. We discuss situations where this mechanism operates. Apart of stochastic models of weighted networks, we introduce a wide class of deterministic, scale-free, weighted graphs with the small-world effect. We show also how one can easily construct an equilibrium weighted network by using a generalization of the configuration model.
11 pages, 9 figures
References in corpus (9)
- The spatial structure of networks
- Optimal Paths in Disordered Complex Networks
- Recursive graphs with small-world scale-free properties
- Constrained spin dynamics description of random walks on hierarchical scale-free networks
- Minimum spanning trees on weighted scale-free networks
- A Model of Weighted Network: the Student Relationships in a Class
- A note on "Weighted Evolving Networks: Coupling Topology and Weight Dynamics"
- A weighted evolving network model more approach to reality
- The Evolution of Interpersonal Relationships in a Social Group