|
Climate As Complex Networks
The field of complex networks has emerged as an important area of science to generate novel insights into nature of complex systems The application of network theory to climate science is a young and emerging field. 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. The climate network approach enables novel insights into the dynamics of the climate system over different spatial and temporal scales. Construction of climate networks Depending upon the choice of nodes and/or edges, climate networks may t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Network
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 (since 2000) inspired largely by empirical findings of real-world networks such as computer networks, biological networks, technological networks, brain networks, climate networks and social networks. Definition Most social, biological, and technological networks display substantial non-trivial topological features, with patterns of connection between their elements that are neither purely regular nor purely random. Such features include a heavy tail in the degree distribution, a high clustering coefficient, assortativity or disassortativity among vertices, community structure, and hierarchical structure. In the case of directed networks these feat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Centrality
In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.Newman, M.E.J. 2010. ''Networks: An Introduction.'' Oxford, UK: Oxford University Press. Definition and characterization of centrality indices Centrality indices are answers to the question "What characterizes an important vertex?" The answer is given in terms of a real-valued function on the vertices of a graph, where the values produced are expected to provide a ranking which identifies the most important nodes. The word "importance" has a wide number of meanings, leading to many diffe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Network Theory
Network theory is the study of graphs as a representation of either symmetric relations or asymmetric relations between discrete objects. In computer science and network science, network theory is a part of graph theory: a network can be defined as a graph in which nodes and/or edges have attributes (e.g. names). Network theory has applications in many disciplines including statistical physics, particle physics, computer science, electrical engineering, biology, archaeology, economics, finance, operations research, climatology, ecology, public health, sociology, and neuroscience. Applications of network theory include logistical networks, the World Wide Web, Internet, gene regulatory networks, metabolic networks, social networks, epistemological networks, etc.; see List of network theory topics for more examples. Euler's solution of the Seven Bridges of Königsberg problem is considered to be the first true proof in the theory of networks. Network optimization Network pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Community Structure
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 (potentially overlapping) 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. Properties In the study of networks, such as computer and information networks, social networks and biological networks, a number of different charac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grid (spatial Index)
In the context of a spatial index, a grid or mesh is a regular tessellation of a manifold or 2-D surface that divides it into a series of contiguous cells, which can then be assigned unique identifiers and used for spatial indexing purposes. A wide variety of such grids have been proposed or are currently in use, including grids based on "square" or "rectangular" cells, triangular grids or meshes, hexagonal grids, and grids based on diamond-shaped cells. A " global grid" is a kind of grid that covers the entire surface of the globe. Types of grids Square or rectangular grids are frequently used for purposes such as translating spatial information expressed in Cartesian coordinates (latitude and longitude) into and out of the grid system. Such grids may or may not be aligned with the grid lines of latitude and longitude; for example, Marsden Squares, World Meteorological Organization squares, c-squares and others are aligned, while Universal Transverse Mercator coordinate sy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Teleconnection
Teleconnection in atmospheric science refers to climate anomalies being related to each other at large distances (typically thousands of kilometers). The most emblematic teleconnection is that linking sea-level pressure at Tahiti and Darwin, Australia, which defines the Southern Oscillation. History Teleconnections were first noted by the British meteorologist Sir Gilbert Walker in the late 19th century, through computation of the correlation between time series of atmospheric pressure, temperature and rainfall. They served as a building block for the understanding of climate variability, by showing that the latter was not purely random. Indeed, the term El Niño–Southern Oscillation (ENSO) is an implicit acknowledgment that the phenomenon underlies variability in several locations at once. It was later noticed that associated teleconnections occurred all over North America, as embodied by the Pacific–North American teleconnection pattern. In the 1980s, improved observati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surface Air Temperature
Temperature measurement (also known as thermometry) describes the process of measuring a current local temperature for immediate or later evaluation. Datasets consisting of repeated standardized measurements can be used to assess temperature trends. History Attempts at standardized temperature measurement prior to the 17th century were crude at best. For instance in 170 AD, physician Claudius Galenus mixed equal portions of ice and boiling water to create a "neutral" temperature standard. The modern scientific field has its origins in the works by Florentine scientists in the 1600s including Galileo constructing devices able to measure relative change in temperature, but subject also to confounding with atmospheric pressure changes. These early devices were called thermoscopes. The first sealed thermometer was constructed in 1654 by the Grand Duke of Toscani, Ferdinand II. The development of today's thermometers and temperature scales began in the early 18th century, when G ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
General Circulation Model
A general circulation model (GCM) is a type of climate model. It employs a mathematical model of the general circulation of a planetary atmosphere or ocean. It uses the Navier–Stokes equations on a rotating sphere with thermodynamic terms for various energy sources (radiation, latent heat). These equations are the basis for computer programs used to simulate the Earth's atmosphere or oceans. Atmospheric and oceanic GCMs (AGCM and OGCM) are key components along with sea ice and land-surface components. GCMs and global climate models are used for weather forecasting, understanding the climate, and forecasting climate change. Versions designed for decade to century time scale climate applications were originally created by Syukuro Manabe and Kirk Bryan at the Geophysical Fluid Dynamics Laboratory (GFDL) in Princeton, New Jersey. These models are based on the integration of a variety of fluid dynamical, chemical and sometimes biological equations. Terminology The acronym ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Betweenness Centrality
In graph theory, betweenness centrality (or "betweeness centrality") is a measure of centrality in a graph based on shortest paths. For every pair of vertices in a connected graph, there exists at least one shortest path between the vertices such that either the number of edges that the path passes through (for unweighted graphs) or the sum of the weights of the edges (for weighted graphs) is minimized. The betweenness centrality for each vertex is the number of these shortest paths that pass through the vertex. Betweenness centrality was devised as a general measure of centrality: it applies to a wide range of problems in network theory, including problems related to social networks, biology, transport and scientific cooperation. Although earlier authors have intuitively described centrality as based on betweenness, gave the first formal definition of betweenness centrality. Betweenness centrality finds wide application in network theory; it represents the degree to which nodes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Degree Distribution
In the study of graphs and networks, the degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network. Definition The degree of a node in a network (sometimes referred to incorrectly as the connectivity) is the number of connections or edges the node has to other nodes. If a network is directed, meaning that edges point in one direction from one node to another node, then nodes have two different degrees, the in-degree, which is the number of incoming edges, and the out-degree, which is the number of outgoing edges. The degree distribution ''P''(''k'') of a network is then defined to be the fraction of nodes in the network with degree ''k''. Thus if there are ''n'' nodes in total in a network and ''n''''k'' of them have degree ''k'', we have P(k) = \frac. The same information is also sometimes presented in the form of a ''cumulative degree distribution'', the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Small World Property
The small-world experiment comprised several experiments conducted by Stanley Milgram and other researchers examining the average path length for social networks of people in the United States. The research was groundbreaking in that it suggested that human society is a small-world-type network characterized by short path-lengths. The experiments are often associated with the phrase "six degrees of separation", although Milgram did not use this term himself. Historical context of the small-world problem Guglielmo Marconi's conjectures based on his radio work in the early 20th century, which were articulated in his 1909 Nobel Prize address, may have inspired Hungarian author Frigyes Karinthy to write a challenge to find another person to whom he could not be connected through at most five people.Barabási, Albert-László . 2003. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Multi-scale Mathematics
Multiscale modeling or multiscale mathematics is the field of solving problems which have important features at multiple scales of time and/or space. Important problems include multiscale modeling of fluids, solids, polymers, proteins, nucleic acids as well as various physical and chemical phenomena (like adsorption, chemical reactions, diffusion). An example of such problems involve the Navier-Stokes equations for incompressible fluid flow. \begin \rho_0(\partial_t\mathbf+(\mathbf\cdot\nabla)\mathbf)=\nabla\cdot\tau, \\ \nabla\cdot\mathbf=0. \end In a wide-variety of applications, the stress tensor \tau is given as a linear function of the gradient \nabla u. Such a choice for \tau has been proven to be sufficient for describing the dynamics of a broad range of fluids. However, it’s use for more complex fluids such as polymers is dubious. In such a case, it may be necessary to use multiscale modeling to accurately model the system such that the stress tensor can be extracted ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
