Controlling extreme events on complex networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Chen YZ
PROVIDER: S-EPMC4135339 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:We investigate the emergence of extreme events in interdependent networks. We introduce an inter-layer traffic resource competing mechanism to account for the limited capacity associated with distinct network layers. A striking finding is that, when the number of network layers and/or the overlap among the layers are increased, extreme events can emerge in a cascading manner on a global scale. Asymptotically, there are two stable absorption states: a state free of extreme events and a state of full of extreme events, and the transition between them is abrupt. Our results indicate that internal interactions in the multiplex system can yield qualitatively distinct phenomena associated with extreme events that do not occur for independent network layers. An implication is that, e.g., public resource competitions among different service providers can lead to a higher resource requirement than naively expected. We derive an analytical theory to understand the emergence of global-scale extreme events based on the concept of effective betweenness. We also articulate a cost-effective control scheme through increasing the capacity of very few hubs to suppress the cascading process of extreme events so as to protect the entire multi-layer infrastructure against global-scale breakdown.
| S-EPMC4661526 | biostudies-other
Project description:Extreme events and the related anomalous statistics are ubiquitously observed in many natural systems, and the development of efficient methods to understand and accurately predict such representative features remains a grand challenge. Here, we investigate the skill of deep learning strategies in the prediction of extreme events in complex turbulent dynamical systems. Deep neural networks have been successfully applied to many imaging processing problems involving big data, and have recently shown potential for the study of dynamical systems. We propose to use a densely connected mixed-scale network model to capture the extreme events appearing in a truncated Korteweg-de Vries (tKdV) statistical framework, which creates anomalous skewed distributions consistent with recent laboratory experiments for shallow water waves across an abrupt depth change, where a remarkable statistical phase transition is generated by varying the inverse temperature parameter in the corresponding Gibbs invariant measures. The neural network is trained using data without knowing the explicit model dynamics, and the training data are only drawn from the near-Gaussian regime of the tKdV model solutions without the occurrence of large extreme values. A relative entropy loss function, together with empirical partition functions, is proposed for measuring the accuracy of the network output where the dominant structures in the turbulent field are emphasized. The optimized network is shown to gain uniformly high skill in accurately predicting the solutions in a wide variety of statistical regimes, including highly skewed extreme events. The technique is promising to be further applied to other complicated high-dimensional systems.
| S-EPMC6955342 | biostudies-literature
Project description:Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.
| S-EPMC5854593 | biostudies-literature
Project description:The ability to control a complex network towards a desired behavior relies on our understanding of the complex nature of these social and technological networks. The existence of numerous control schemes in a network promotes us to wonder: what is the underlying relationship of all possible input nodes? Here we introduce input graph, a simple geometry that reveals the complex relationship between all control schemes and input nodes. We prove that the node adjacent to an input node in the input graph will appear in another control scheme, and the connected nodes in input graph have the same type in control, which they are either all possible input nodes or not. Furthermore, we find that the giant components emerge in the input graphs of many real networks, which provides a clear topological explanation of bifurcation phenomenon emerging in dense networks and promotes us to design an efficient method to alter the node type in control. The findings provide an insight into control principles of complex networks and offer a general mechanism to design a suitable control scheme for different purposes.
| S-EPMC5128914 | biostudies-literature
Project description:Climatic and other extreme events threaten the globalized economy, which relies on increasingly complex and specialized supply-chain networks. Disasters generate (i) direct economic losses due to reduced production in the locations where they occur, and (ii) to indirect losses from the supply shortages and demand changes that cascade along the supply chains. Firms can use inventories to reduce their risk of shortages. Since firms are interconnected through the supply chain, the level of inventory hold by one firm influences the risk of shortages of the others. Such interdependencies lead to systemic risks in supply chain networks. We introduce a stylized model of complex supply-chain networks in which firms adjust their inventory to maximize profit. We analyze the resulting risks and inventory patterns using evolutionary game theory. We report the following findings. Inventories significantly reduce disruption cascades and indirect losses at the expense of a moderate increase in direct losses. The more fragmented a supply chain is, the less beneficial it is for individual firms to maintain inventories, resulting in higher systemic risks. One way to mitigate such systemic risks is to prescribe inventory sizes to individual firms-a measure that could, for instance, be fostered by insurers. We found that prescribing firm-specific inventory sizes based on their position in the supply chain mitigates systemic risk more effectively than setting the same inventory requirements for all firms.
| S-EPMC7769560 | biostudies-literature
Project description:The prediction of extreme events, from avalanches and droughts to tsunamis and epidemics, depends on the formulation and analysis of relevant, complex dynamical systems. Such dynamical systems are characterized by high intrinsic dimensionality with extreme events having the form of rare transitions that are several standard deviations away from the mean. Such systems are not amenable to classical order-reduction methods through projection of the governing equations due to the large intrinsic dimensionality of the underlying attractor as well as the complexity of the transient events. Alternatively, data-driven techniques aim to quantify the dynamics of specific, critical modes by utilizing data-streams and by expanding the dimensionality of the reduced-order model using delayed coordinates. In turn, these methods have major limitations in regions of the phase space with sparse data, which is the case for extreme events. In this work, we develop a novel hybrid framework that complements an imperfect reduced order model, with data-streams that are integrated though a recurrent neural network (RNN) architecture. The reduced order model has the form of projected equations into a low-dimensional subspace that still contains important dynamical information about the system and it is expanded by a long short-term memory (LSTM) regularization. The LSTM-RNN is trained by analyzing the mismatch between the imperfect model and the data-streams, projected to the reduced-order space. The data-driven model assists the imperfect model in regions where data is available, while for locations where data is sparse the imperfect model still provides a baseline for the prediction of the system state. We assess the developed framework on two challenging prototype systems exhibiting extreme events. We show that the blended approach has improved performance compared with methods that use either data streams or the imperfect model alone. Notably the improvement is more significant in regions associated with extreme events, where data is sparse.
| S-EPMC5967742 | biostudies-literature
Project description:We consider two elementary (max-flow and uniform-flow) and two realistic (max-min fairness and proportional fairness) congestion control schemes, and analyse how the algorithms and network structure affect throughput, the fairness of flow allocation, and the location of bottleneck edges. The more realistic proportional fairness and max-min fairness algorithms have similar throughput, but path flow allocations are more unequal in scale-free than in random regular networks. Scale-free networks have lower throughput than their random regular counterparts in the uniform-flow algorithm, which is favoured in the complex networks literature. We show, however, that this relation is reversed on all other congestion control algorithms for a region of the parameter space given by the degree exponent ? and average degree ?k?. Moreover, the uniform-flow algorithm severely underestimates the network throughput of congested networks, and a rich phenomenology of path flow allocations is only present in the more realistic ?-fair family of algorithms. Finally, we show that the number of paths passing through an edge characterises the location of a wide range of bottleneck edges in these algorithms. Such identification of bottlenecks could provide a bridge between the two fields of complex networks and congestion control.
| S-EPMC5567293 | biostudies-other
Project description:We have performed direct numerical simulations of homogeneous and isotropic turbulence in a periodic box with 8,192(3) grid points. These are the largest simulations performed, to date, aimed at improving our understanding of turbulence small-scale structure. We present some basic statistical results and focus on "extreme" events (whose magnitudes are several tens of thousands the mean value). The structure of these extreme events is quite different from that of moderately large events (of the order of 10 times the mean value). In particular, intense vorticity occurs primarily in the form of tubes for moderately large events whereas it is much more "chunky" for extreme events (though probably overlaid on the traditional vortex tubes). We track the temporal evolution of extreme events and find that they are generally short-lived. Extreme magnitudes of energy dissipation rate and enstrophy occur simultaneously in space and remain nearly colocated during their evolution.
| S-EPMC4611667 | biostudies-other
Project description:Extreme climatic events (ECEs) have a disproportionate effect on ecosystems. Yet much of what we know about the ecological impact of ECEs is based on observing the effects of single extreme events. We examined what characteristics affect the strength of inference that can be drawn from single-event studies, which broadly fell into three categories: opportunistic observational studies initiated after an ECE, long-term observational studies with data before and after an ECE and experiments. Because extreme events occur rarely, inference from such single-event studies cannot easily be made under the usual statistical paradigm that relies on replication and control. However, single-event studies can yield important information for theory development and can contribute to meta-analyses. Adaptive management approaches can be used to learn from single, or a few, extreme events. We identify a number of factors that can make observations of single events more informative. These include providing robust estimates of the magnitude of ecological responses and some measure of climatic extremeness, collecting ancillary data that can inform on mechanisms, continuing to observe the biological system after the ECE and combining observational data with experiments and models. Well-designed single-event studies are an important contribution to our understanding of biological effects of ECEs.This article is part of the themed issue 'Behavioural, ecological and evolutionary responses to extreme climatic events'.
| S-EPMC5434092 | biostudies-literature
Project description:Understanding structural controllability of a complex network requires to identify a Minimum Input nodes Set (MIS) of the network. Finding an MIS is known to be equivalent to computing a maximum matching of the network, where the unmatched nodes constitute an MIS. However, maximum matching is often not unique for a network, and finding all possible input nodes, the union of all MISs, may provide deep insights to the controllability of the network. Here we present an efficient enumerative algorithm for the problem. The main idea is to modify a maximum matching algorithm to make it efficient for finding all possible input nodes by computing only one MIS. The algorithm can also output a set of substituting nodes for each input node in the MIS, so that any node in the set can replace the latter. We rigorously proved the correctness of the new algorithm and evaluated its performance on synthetic and large real networks. The experimental results showed that the new algorithm ran several orders of magnitude faster than an existing method on large real networks.
| S-EPMC5587595 | biostudies-literature