Edge overload breakdown in evolving networks

Details Edge overload breakdown in evolving networks Edge overload breakdown in evolving networks

2002-07-18

arxiv.org/abs/cond-mat/0207466v1

Phys. Rev. E 66, 036119 (2002)

Physics

Condensed Matter

Disordered Systems and Neural Networks

To appear in Phys. Rev. E

Scientific paper

10.1103/PhysRevE.66.036119

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, as 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 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.

Affiliated with

Also associated with

No associations

Rating

Edge overload breakdown in evolving networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Edge overload breakdown in evolving networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge overload breakdown in evolving networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-397056