• Corpus ID: 15926140

The information dynamics of cascading failures in energy networks

  title={The information dynamics of cascading failures in energy networks},
  author={Joseph T. Lizier and Mikhail Prokopenko and David Cornforth},
Small failures in electrical energy networks can lead to cascading failures that cause large and sustained power blackouts. These can disrupt important services and cost millions of dollars. It is important to understand these events so that they may be avoided. We use an existing model for cascading failures to study the information dynamics in these events, where the network is collectively computing a new stable distribution of flows. In particular, information transfer and storage across… 

Figures from this paper

Information Dynamics in Small-World Boolean Networks
An ensemble investigation of the computational capabilities of small-world networks as compared to ordered and random topologies finds that the ordered phase of the dynamics and topologies with low randomness are dominated by information storage, while the chaotic phase is dominated byInformation storage and information transfer.
Information storage and transfer in the synchronization process in locally-connected networks
Information-theoretical techniques are used to view the synchronization process as a distributed computation, and to measure the information storage and transfer at each node in the system at each time step, producing novel insights, including that the computation of the synchronized state appears to be completed much more quickly than application-specific measures would indicate.
Information Dynamics in Networks and Phase Transitions
The main challenge is understanding the dynamics of the propagation of information in networks, and how these networks process such information.
Criticality and Information Dynamics in Epidemiological Models
This study simulates a Susceptible-Infected-Susceptible (SIS) epidemic on a homogeneous network and shows that both (bias-corrected) transfer entropy and active information storage maximise after the critical threshold, the first step toward an information dynamics approach to epidemics.
Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks
A new measure is proposed that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states, that can be extended to include random walk based definitions and its computational complexity is shown to be of the same order as that of betweenness centrality.
Deriving pairwise transfer entropy from network structure and motifs
These findings also apply to Granger causality, which is equivalent to TE for Gaussian variables, and similar empirical results on random Boolean networks suggest that the dependence of the TE on the in-degree extends to nonlinear dynamics.
Title Percolation Centrality : Quantifying Graph-Theoretic Impact ofNodes during Percolation in Networks
Percolation centrality is proposed, a new measure that quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states, in networks and its computational complexity is shown to be of the same order as that of betweenness centrality.
Early lock-in of structured and specialised information flows during neural development
This work characterises the flow of information during the crucial periods of population bursts and finds that, during these bursts, nodes tend to undertake specialised computational roles as either transmitters, mediators, or receivers of information, with these roles tending to align with their average spike ordering.


Model for cascading failures in complex networks.
It is shown that the breakdown of a single node is sufficient to collapse the efficiency of the entire system if the node is among the ones with largest load.
Cascade-based attacks on complex networks.
  • A. Motter, Y. Lai
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
It is demonstrated that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node.
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
The Information Dynamics of Phase Transitions in Random Boolean Networks
This work uses a recently published framework to characterize the distributed computation in terms of its underlying information dynamics: information storage, information transfer and information modification, and finds maximizations in information storage and coherent information transfer on either side of the critical point.
Universal behavior of load distribution in scale-free networks.
It is conjecture that the load exponent is a universal quantity to characterize scale-free networks and valid for both undirected and directed cases.
Mutual information in random Boolean models of regulatory networks.
This work studies average pairwise mutual information in random Boolean networks (RBNs) as a function of the distribution of Boolean rules implemented at each element, assuming that the links in the network are randomly placed.
Burstiness and memory in complex systems
It is found that for human dynamics memory is weak, and the bursty character is due to the changes in the interevent time distribution, and it is shown that current models lack in their ability to reproduce the activity pattern observed in real systems, opening up avenues for future work.
Local information transfer as a spatiotemporal filter for complex systems.
A measure of local information transfer, derived from an existing averaged information-theoretical measure, namely, transfer entropy, is presented, providing the first quantitative evidence for the long-held conjecture that the emergent traveling coherent structures known as particles are the dominant information transfer agents in cellular automata.
Detecting Non-trivial Computation in Complex Dynamics
This work quantifies the local information dynamics at each spatiotemporal point in a complex system in terms of each element of computation: information storage, transfer and modification to provide the first quantitative evidence that collisions between particles therein are the dominant information modification events.