Iterative decomposition of Barabasi–Albert scale-free networks

S.S.B. Jácome, L.R. da Silva, A.A. Moreira, J.S. Andrade and H.J. Herrmann

Physica A: Statistical Mechanics and its Applications, 2010, vol. 389, issue 17, 3674-3677

Abstract: We study a decomposition process where all nodes with a targeted degree are removed from the network. Each removal step results in changes in the degrees of the remaining nodes, and other nodes may attain the targeted degree. The processes continue iteratively until no more nodes with the targeted degree are present in the decomposed network. The network model used in our study is the well known Barabasi–Albert network, that is built with an iterative growth based on preferential attachment. Our results show an exponential decay of the number of nodes removed at each step. The total number of nodes removed in the whole process depends on the targeted degree and decay with a power law controlled by the same exponent as the degree distribution of the network.

Keywords: Network; Decomposition; Scaling (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437110002980
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:389:y:2010:i:17:p:3674-3677

DOI: 10.1016/j.physa.2010.03.052

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