Edge overload breakdown in evolving networks.

  title={Edge overload breakdown in evolving networks.},
  author={Petter Holme},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={66 3 Pt 2A},
  • Petter Holme
  • Published 2002 in
    Physical review. E, Statistical, nonlinear, and…
We investigate growing networks based on Barabási 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… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
35 Citations
0 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 35 extracted citations

54 Citations

Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…