Generation models for scale-free networks

Chavdar Dangalchev

Physica A: Statistical Mechanics and its Applications, 2004, vol. 338, issue 3, 659-671

Abstract: In the last few years it has been established that the connectivity distribution of the large real-world networks often follows the power-law, i.e., they are scale-free networks. In this article stochastic models leading to scale-free network are considered and a model close to them is proposed. Deterministic models for creating scale-free networks with given nodes (static model) are demonstrated. A characteristic of graphs, which could be used for determining the scale-free topology of networks, is suggested.

Keywords: Random networks; Scale-free networks; Collaboration graph; Deterministic static model (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437104001402
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:338:y:2004:i:3:p:659-671

DOI: 10.1016/j.physa.2004.01.056

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 ().