The field of complex networks has emerged as an important area of science to generate novel insights into nature of complex systems [1] The application of network theory to climate science is a young and emerging field. [2] [3] [4] To identify and analyze patterns in global climate, scientists model climate data as complex networks.
Unlike most real-world networks where nodes and edges are well defined, in climate networks, nodes are identified as the sites in a spatial grid of the underlying global climate data set, which can be represented at various resolutions. Two nodes are connected by an edge depending on the degree of statistical similarity (that may be related to dependence) between the corresponding pairs of time-series taken from climate records. [3] [5] The climate network approach enables novel insights into the dynamics of the climate system over different spatial and temporal scales. [3]
Depending upon the choice of nodes and/or edges, climate networks may take many different forms, shapes, sizes and complexities. Tsonis et al. introduced the field of complex networks to climate. In their model, the nodes for the network were constituted by a single variable (500 hPa) from NCEP/NCAR Reanalysis datasets. In order to estimate the edges between nodes, correlation coefficient at zero time lag between all possible pairs of nodes were estimated. A pair of nodes was considered to be connected, if their correlation coefficient is above a threshold of 0.5. [1]
Steinhaeuser and team introduced the novel technique of multivariate networks in climate by constructing networks from several climate variables separately and capture their interaction in multivariate predictive model. It was demonstrated in their studies that in context of climate, extracting predictors based on cluster attributes yield informative precursors to improve predictive skills. [5]
Kawale et al. presented a graph based approach to find dipoles in pressure data. Given the importance of teleconnection, this methodology has potential to provide significant insights. [6]
Imme et al. introduced a new type of network construction in climate based on temporal probabilistic graphical model, which provides an alternative viewpoint by focusing on information flow within network over time. [7]
Agarwal et al. proposed advanced linear [8] and nonlinear [9] methods to construct and investigate climate networks at different timescales. Climate networks constructed using SST datasets at different timescale averred that multi-scale analysis of climatic processes holds the promise of better understanding the system dynamics that may be missed when processes are analyzed at one timescale only [10]
Climate networks enable insights into the dynamics of climate system over many spatial scales. The local degree centrality and related measures have been used to identify super-nodes and to associate them to known dynamical interrelations in the atmosphere, called teleconnection patterns. It was observed that climate networks possess “small world” properties owing to the long-range spatial connections. [2]
Steinhaeuser et al. applied complex networks to explore the multivariate and multi-scale dependence in climate data. Findings of the group suggested a close similarity of observed dependence patterns in multiple variables over multiple time and spatial scales. [4]
Tsonis and Roeber investigated the coupling architecture of the climate network. It was found that the overall network emerges from intertwined subnetworks. One subnetwork is operating at higher altitudes and other is operating in the tropics, while the equatorial subnetwork acts as an agent linking the 2 hemispheres . Though, both networks possess Small World Property, the 2 subnetworks are significantly different from each other in terms of network properties like degree distribution. [11]
Donges et al. applied climate networks for physics and nonlinear dynamical interpretations in climate. The team used measure of node centrality, betweenness centrality (BC) to demonstrate the wave-like structures in the BC fields of climate networks constructed from monthly averaged reanalysis and atmosphere-ocean coupled general circulation model (AOGCM) surface air temperature (SAT) data. [12]
Teleconnections are spatial patterns in the atmosphere that link weather and climate anomalies over large distances across the globe. Teleconnections have the characteristics that they are persistent, lasting for 1 to 2 weeks, and often much longer, and they are recurrent, as similar patterns tend to occur repeatedly. The presence of teleconnections is associated with changes in temperature, wind, precipitation, atmospheric variables of greatest societal interest. [13]
There are numerous computational challenges that arise at various stages of the network construction and analysis process in field of climate networks: [14]
A complex system is a system composed of many components which may interact with each other. Examples of complex systems are Earth's global climate, organisms, the human brain, infrastructure such as power grid, transportation or communication systems, complex software and electronic systems, social and economic organizations, an ecosystem, a living cell, and, ultimately, for some authors, the entire universe.
A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times. Wavelets are termed a "brief oscillation". A taxonomy of wavelets has been established, based on the number and direction of its pulses. Wavelets are imbued with specific properties that make them useful for signal processing.
A scale-free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P(k) of nodes in the network having k connections to other nodes goes for large values of k as
In descriptive statistics and chaos theory, a recurrence plot (RP) is a plot showing, for each moment in time, the times at which the state of a dynamical system returns to the previous state at , i.e., when the phase space trajectory visits roughly the same area in the phase space as at time . In other words, it is a plot of
In mathematics, computer science and network science, network theory is a part of graph theory. It defines networks as graphs where the vertices or edges possess attributes. Network theory analyses these networks over the symmetric relations or asymmetric relations between their (discrete) components.
A small-world network is a graph characterized by a high clustering coefficient and low distances. On an example of social network, high clustering implies the high probability that two friends of one person are friends themselves. The low distances, on the other hand, mean that there is a short chain of social connections between any two people. Specifically, a small-world network is defined to be a network where the typical distance L between two randomly chosen nodes grows proportionally to the logarithm of the number of nodes N in the network, that is:
In the context of network theory, a complex network is a graph (network) with non-trivial topological features—features that do not occur in simple networks such as lattices or random graphs but often occur in networks representing real systems. The study of complex networks is a young and active area of scientific research inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks.
In the study of complex networks, a network is said to have community structure if the nodes of the network can be easily grouped into sets of nodes such that each set of nodes is densely connected internally. In the particular case of non-overlapping community finding, this implies that the network divides naturally into groups of nodes with dense connections internally and sparser connections between groups. But overlapping communities are also allowed. The more general definition is based on the principle that pairs of nodes are more likely to be connected if they are both members of the same community(ies), and less likely to be connected if they do not share communities. A related but different problem is community search, where the goal is to find a community that a certain vertex belongs to.
In network science, a gradient network is a directed subnetwork of an undirected "substrate" network where each node has an associated scalar potential and one out-link that points to the node with the smallest potential in its neighborhood, defined as the union of itself and its neighbors on the substrate network.
A Boolean network consists of a discrete set of boolean variables each of which has a Boolean function assigned to it which takes inputs from a subset of those variables and output that determines the state of the variable it is assigned to. This set of functions in effect determines a topology (connectivity) on the set of variables, which then become nodes in a network. Usually, the dynamics of the system is taken as a discrete time series where the state of the entire network at time t+1 is determined by evaluating each variable's function on the state of the network at time t. This may be done synchronously or asynchronously.
Reservoir computing is a framework for computation derived from recurrent neural network theory that maps input signals into higher dimensional computational spaces through the dynamics of a fixed, non-linear system called a reservoir. After the input signal is fed into the reservoir, which is treated as a "black box," a simple readout mechanism is trained to read the state of the reservoir and map it to the desired output. The first key benefit of this framework is that training is performed only at the readout stage, as the reservoir dynamics are fixed. The second is that the computational power of naturally available systems, both classical and quantum mechanical, can be used to reduce the effective computational cost.
A coupled map lattice (CML) is a dynamical system that models the behavior of nonlinear systems. They are predominantly used to qualitatively study the chaotic dynamics of spatially extended systems. This includes the dynamics of spatiotemporal chaos where the number of effective degrees of freedom diverges as the size of the system increases.
The study of interdependent networks is a subfield of network science dealing with phenomena caused by the interactions between complex networks. Though there may be a wide variety of interactions between networks, dependency focuses on the scenario in which the nodes in one network require support from nodes in another network.
Jürgen Kurths is a German physicist and mathematician. He is senior advisor in the research department Complexity Sciences of the Potsdam Institute for Climate Impact Research, a Professor of Nonlinear Dynamics at the Institute of Physics at the Humboldt University, Berlin, and a 6th-century chair for Complex Systems Biology at the Institute for Complex Systems and Mathematical Biology at Kings College, Aberdeen University (UK). His research is mainly concerned with nonlinear physics and complex systems sciences and their applications to challenging problems in Earth system, physiology, systems biology and engineering.
A temporal network, also known as a time-varying network, is a network whose links are active only at certain points in time. Each link carries information on when it is active, along with other possible characteristics such as a weight. Time-varying networks are of particular relevance to spreading processes, like the spread of information and disease, since each link is a contact opportunity and the time ordering of contacts is included.
Quantum complex networks are complex networks whose nodes are quantum computing devices. Quantum mechanics has been used to create secure quantum communications channels that are protected from hacking. Quantum communications offer the potential for secure enterprise-scale solutions.
The Bianconi–Barabási model is a model in network science that explains the growth of complex evolving networks. This model can explain that nodes with different characteristics acquire links at different rates. It predicts that a node's growth depends on its fitness and can calculate the degree distribution. The Bianconi–Barabási model is named after its inventors Ginestra Bianconi and Albert-László Barabási. This model is a variant of the Barabási–Albert model. The model can be mapped to a Bose gas and this mapping can predict a topological phase transition between a "rich-get-richer" phase and a "winner-takes-all" phase.
Michael Ghil is an American and European mathematician and physicist, focusing on the climate sciences and their interdisciplinary aspects. He is a founder of theoretical climate dynamics, as well as of advanced data assimilation methodology. He has systematically applied dynamical systems theory to planetary-scale flows, both atmospheric and oceanic. Ghil has used these methods to proceed from simple flows with high temporal regularity and spatial symmetry to the observed flows, with their complex behavior in space and time. His studies of climate variability on many time scales have used a full hierarchy of models, from the simplest ‘toy’ models all the way to atmospheric, oceanic and coupled general circulation models. Recently, Ghil has also worked on modeling and data analysis in population dynamics, macroeconomics, and the climate–economy–biosphere system.
Auroop Ratan Ganguly is an American hydrologist, a climate and computational scientist, and a civil engineer of Indian origin best known for his work at the intersection of climate extremes and water sustainability, infrastructural resilience and homeland security, and artificial intelligence and nonlinear dynamics.
Physics-informed neural networks (PINNs), also referred to as Theory-Trained Neural Networks (TTNs), are a type of universal function approximators that can embed the knowledge of any physical laws that govern a given data-set in the learning process, and can be described by partial differential equations (PDEs).They overcome the low data availability of some biological and engineering systems that makes most state-of-the-art machine learning techniques lack robustness, rendering them ineffective in these scenarios. The prior knowledge of general physical laws acts in the training of neural networks (NNs) as a regularization agent that limits the space of admissible solutions, increasing the correctness of the function approximation. This way, embedding this prior information into a neural network results in enhancing the information content of the available data, facilitating the learning algorithm to capture the right solution and to generalize well even with a low amount of training examples.