Random removal of edges from scale free graphs

S. Martin, R.D. Carr and J.-L. Faulon

Physica A: Statistical Mechanics and its Applications, 2006, vol. 371, issue 2, 870-876

Abstract: It has been discovered that many naturally occurring networks (the internet, the power grid of the western US, various biological networks, etc.) satisfy a power-law degree distribution. Such scale-free networks have many interesting properties, one of which is robustness to random damage. This problem has been analyzed from the point of view of node deletion and connectedness. Recently, it has also been considered from the point of view of node deletion and scale preservation. In this paper we consider the problem from the point of view of edge deletion and scale preservation. In agreement with the work on node deletion and scale preservation, we show that a scale-free graph should not be expected to remain scale free when edges are removed at random.

Keywords: Scale-free graphs; Power law; Edge removal (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437106004626
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:371:y:2006:i:2:p:870-876

DOI: 10.1016/j.physa.2006.04.046

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