Edge overload breakdown in evolving networks
2002 (English)In: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, ISSN 1063-651X, E-ISSN 1095-3787, Vol. 66, no 3, 036119- p.Article in journal (Refereed) Published
We investigate growing networks based on Barabasi and Albert's algorithm for generating scale-free networks, but with edges sensitive to overload breakdown. The load is defined through edge betweenness centrality. We focus on the situation where the average number of connections per vertex is, like the number of vertices, linearly increasing in time. After an initial stage of growth, the network undergoes avalanching breakdowns to a fragmented state from which it never recovers. This breakdown is much less violent if the growth is by random rather than by preferential attachment (as defines the Barabasi and Albert model). We briefly discuss the case where the average number of connections per vertex is constant. In this case no breakdown avalanches occur. Implications to the growth of real-world communication networks are discussed.
Place, publisher, year, edition, pages
2002. Vol. 66, no 3, 036119- p.
Colloids, Crystal defects, Data reduction, Deformation, Elastic moduli, Free energy, Gels, Optical microscopy, Rheology, Viscoelasticity
IdentifiersURN: urn:nbn:se:kth:diva-24453DOI: 10.1103/PhysRevE.66.036119ISI: 000178624100028OAI: oai:DiVA.org:kth-24453DiVA: diva2:349965
QC 201009092010-09-092010-09-092010-09-09Bibliographically approved