Two-level relationships and scale-free networks
Abstract
Through the distinction between “real” and “virtual” links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with preferential attachment, our procedure is both faster than a naïve implementation of the Barabási and Albert model and exhibits different clustering properties. The model is thoroughly studied numerically and suggests that reducing the set of partners a node can connect to is important in seizing the diversity of scale-free structures.
- Publication:
-
Physica A Statistical Mechanics and its Applications
- Pub Date:
- June 2006
- DOI:
- 10.1016/j.physa.2005.12.070
- arXiv:
- arXiv:cond-mat/0508434
- Bibcode:
- 2006PhyA..365..565S
- Keywords:
-
- Condensed Matter - Statistical Mechanics;
- Condensed Matter - Disordered Systems and Neural Networks
- E-Print:
- Physica A, 365, 565-570 (2006)