Time-cumulative scale-free networks without both growth and preferential attachment

Xiao-Pu Han and Yan-Bo Xie

Physica A: Statistical Mechanics and its Applications, 2007, vol. 381, issue C, 525-531

Abstract: A model of nongrowing networks with time-cumulative scale-free (SF) property based on the apply–reply process is proposed in this paper. This model is not only without growth but also without a direct expression of preferential attachment. The network structure is evolved by the change of nodes’ active probability, which is mathematically equivalent to a special diffusion process. This model only allows zero or one edge connecting on a node at any moment, and the power-law degree distributions can be exhibited from the statistic of the network after a long time accumulation. Our results imply that both growth and direct preferential attachments are not necessary in the generation of the SF property.

Keywords: Scale-free networks; Nongrowing networks model; Degree distribution; Time-cumulative degree; Apply–reply Process; Complex networks (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437107003408
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:381:y:2007:i:c:p:525-531

DOI: 10.1016/j.physa.2007.04.002

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