Two-level relationships and scale-free networks

F. Stauffer

Physica A: Statistical Mechanics and its Applications, 2006, vol. 365, issue 2, 565-570

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.

Keywords: Complex networks; Computational methods (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437106001154
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:365:y:2006:i:2:p:565-570

DOI: 10.1016/j.physa.2005.12.070

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().