Failures and avalanches in complex networks

Bakke, Jan Øystein Haavig; Hansen, Alex; Kertész, János

doi:10.1209/epl/i2006-10324-1

Cited by 46 publications

(39 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…26 Important to mention that k [α] i is interpreted in a weighted 27 network that is more available airlines between a pair of 28 airports does not change the degree, however changes the 29 opportunities of travelers.…”

Section: The Total Number Of Links In Layermentioning

confidence: 99%

Weighted multiplex network of air transportation

Вaргa

2016

Eur. Phys. J. B

View full text Add to dashboard Cite

Abstract. In several real networks large heterogeneity of links is present either in intensity or in the nature of relationships. Therefore, recent studies in network science indicate that more detailed topological information are available if weighted or multi-layer aspect is applied. In the age of globalization air transportation is a representative example of huge complex infrastructure systems, which has been analyzed form different points of view. In this paper a novel approach is applied to study the airport network as a weighted multiplex taking into account the fact that the rules and fashion of domestic and international flights differ. Restricting study to only topological features and their correlations in the system (disregarding traffic) one can see reasons why simple network approximation is not adequate.

show abstract

Section: The Total Number Of Links In Layermentioning

confidence: 99%

Weighted multiplex network of air transportation

Вaргa

2016

Eur. Phys. J. B

View full text Add to dashboard Cite

show abstract

“…These algebraic tails obtained in the numerical calculations are consistent with those observed in blackouts of real power systems. [7][8][9][10][11][12][13] Most importantly, the OPA model permits us to separate the underlying causes for cascading blackouts from the triggers that initiate them and therefore explore system characteristics that enhance or degrade resilience and reliability of the power transmission grid. One of these characteristics, the one investigated here, is the network structure and the heterogeneity of the network induced by linking homogeneous structures.…”

Section: Introductionmentioning

confidence: 99%

The interplay of network structure and dispatch solutions in power grid cascading failures

Reynolds-Barredo

Newman

Carreras

et al. 2016

Chaos: An Interdisciplinary Journal of Nonlinear Science

View full text Add to dashboard Cite

For a given minimum cost of the electricity dispatch, multiple equivalent dispatch solutions may exist. We explore the sensitivity of networks to these dispatch solutions and their impact on the vulnerability of the network to cascading failure blackouts. It is shown that, depending on the heterogeneity of the network structure, the blackout statistics can be sensitive to the dispatch solution chosen, with the clustering coefficient of the network being a key ingredient. We also investigate mechanisms or configurations that decrease discrepancies that can occur between the different dispatch solutions. Disciplines Electrical and Computer Engineering | Power and Energy | Systems and Communications CommentsThis article is published as Reynolds-Barredo, Jose M., David E. Newman, Benjamin A. Carreras, and Ian Dobson. "The interplay of network structure and dispatch solutions in power grid cascading failures. The interplay of network structure and dispatch solutions in power grid cascading failures The interplay of network structure and dispatch solutions in power grid cascading failures For a given minimum cost of the electricity dispatch, multiple equivalent dispatch solutions may exist. We explore the sensitivity of networks to these dispatch solutions and their impact on the vulnerability of the network to cascading failure blackouts. It is shown that, depending on the heterogeneity of the network structure, the blackout statistics can be sensitive to the dispatch solution chosen, with the clustering coefficient of the network being a key ingredient. We also investigate mechanisms or configurations that decrease discrepancies that can occur between the different dispatch solutions. The OPA (ORNL-PSerc-Alaska) model has been used to explore the power networks' robustness as characterized by the risk of large failures and temporal dynamics. In this model, the power demand is increased at a constant rate while the generation is periodically increased in response to the demand. In doing so, the system keeps the generation capacity margin above a given value. Each day power is dispatched, and generation is selected and optimized to exactly balance the load with minimum cost. This optimization problem is degenerate (there can be more than one optimal solution), so many different dispatch procedures are possible. As one might expect, even if the dispatch solutions are exactly equivalent from the optimization point of view (they reach the same optimal value), it is found that the long term statistics of the problem (power law tails, risk of failures, etc.) can be quite different. In this work, we try to understand how the structure of the network affects the sensitivity of the long term statistics to the dispatch solution chosen. We have found that linked networks are more sensitive to the dispatch chosen than homogeneous networks. In other words, in the case of linked networks, the simulation results can strongly differ when the dispatch is modified. Of particular note, the average clustering coefficient of the ...

show abstract

“…Several real-world complex systems are underlaid by this type of dynamics, including accesses to WWW pages [10], disease spread [11], power distribution collapse [12], and underground and highway systems [13,14]. Frequently the activation of these systems starts at a specific node, or set of nodes, henceforth called sources, and unfolds into the remainder of the network in ways that are intrinsically dependent on the network topology [15].…”

Section: Introductionmentioning

confidence: 99%

Effective number of accessed nodes in complex networks

2012

View full text Add to dashboard Cite

The measurement called accessibility has been proposed as a means to quantify the efficiency of the communication between nodes in complex networks. This article reports results regarding the properties of accessibility, including its relationship with the average minimal time to visit all nodes reachable after h steps along a random walk starting from a source, as well as the number of nodes that are visited after a finite period of time. We characterize the relationship between accessibility and the average number of walks required in order to visit all reachable nodes (the exploration time), conjecture that the maximum accessibility implies the minimal exploration time, and confirm the relationship between the accessibility values and the number of nodes visited after a basic time unit. The latter relationship is investigated with respect to three types of dynamics: traditional random walks, self-avoiding random walks, and preferential random walks.

show abstract

Failures and avalanches in complex networks

Cited by 46 publications

References 18 publications

Weighted multiplex network of air transportation

Weighted multiplex network of air transportation

The interplay of network structure and dispatch solutions in power grid cascading failures

Effective number of accessed nodes in complex networks

Contact Info

Product

Resources

About