Browse
Submit Data
Databases
API
Help

Dataset Information

24 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Lagrangian betweenness as a measure of bottlenecks in dynamical systems with oceanographic examples.

ABSTRACT: The study of connectivity patterns in networks has brought novel insights across diverse fields ranging from neurosciences to epidemic spreading or climate. In this context, betweenness centrality has demonstrated to be a very effective measure to identify nodes that act as focus of congestion, or bottlenecks, in the network. However, there is not a way to define betweenness outside the network framework. By analytically linking dynamical systems and network theory, we provide a trajectory-based formulation of betweenness, called Lagrangian betweenness, as a function of Lyapunov exponents. This extends the concept of betweenness beyond the context of network theory relating hyperbolic points and heteroclinic connections in any dynamical system to the structural bottlenecks of the network associated with it. Using modeled and observational velocity fields, we show that such bottlenecks are present and surprisingly persistent in the oceanic circulation across different spatio-temporal scales and we illustrate the role of these areas in driving fluid transport over vast oceanic regions. Analyzing plankton abundance data from the Kuroshio region of the Pacific Ocean, we find significant spatial correlations between measures of diversity and betweenness, suggesting promise for ecological applications.

SUBMITTER: Ser-Giacomi E

PROVIDER: S-EPMC8368092 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

A spatial interaction incorporated betweenness centrality measure.

Project description:Betweenness centrality (BC) is widely used to identify critical nodes in a network by exploring the ability of all nodes to act as intermediaries for information exchange. However, one of its assumptions, i.e., the contributions of all shortest paths are equal, is inconsistent with variations in spatial interactions along these paths and has been questioned when applied to spatial networks. Hence, this paper proposes a spatial interaction incorporated betweenness centrality (SIBC) for spatial networks. SIBC weights the shortest path between each node pair according to the intensity of spatial interaction between them, emphasizing the combination of a network structure and spatial interactions. To test the rationality and validity of SIBC in identifying critical nodes and edges, two specific forms of SIBC are applied to the Shenzhen street network and China's intercity network. The results demonstrate that SIBC is more significant than BC when we also focus on the network functionality rather than only on the network structure. Moreover, the good performance of SIBC in robustness analysis illustrates its application value in improving network efficiency. This study highlights the meaning of introducing spatial configuration into empirical models of complex networks.

| S-EPMC9122268 | biostudies-literature

Lagrangian dynamical geography of the Gulf of Mexico.

Project description:We construct a Markov-chain representation of the surface-ocean Lagrangian dynamics in a region occupied by the Gulf of Mexico (GoM) and adjacent portions of the Caribbean Sea and North Atlantic using satellite-tracked drifter trajectory data, the largest collection so far considered. From the analysis of the eigenvectors of the transition matrix associated with the chain, we identify almost-invariant attracting sets and their basins of attraction. With this information we decompose the GoM's geography into weakly dynamically interacting provinces, which constrain the connectivity between distant locations within the GoM. Offshore oil exploration, oil spill contingency planning, and fish larval connectivity assessment are among the many activities that can benefit from the dynamical information carried in the geography constructed here.

| S-EPMC5539163 | biostudies-literature

A measure of centrality in cyclic diffusion processes: Walk-betweenness.

Project description:Unlike many traditional measures of centrality based on paths that do not allow any repeated nodes or lines, we propose a new measure of centrality based on walks, walk-betweenness, that allows any number of repeated nodes or lines. To illustrate the value of walk-betweenness, we examine the transmission of syphilis in Chicago area and the diffusion of microfinance in 43 rural Indian villages. Walk-betweenness allows us to identify hidden bridging communities in Chicago that were essential in the transmission dynamics. We also find that village leaders with high walk-betweenness are more likely to accelerate the rate of microfinance take-up among their followers, outperforming other traditional centrality measures in regression analyses.

| S-EPMC7842912 | biostudies-literature

Identifying dynamical bottlenecks of stochastic transitions in biochemical networks.

Project description:In biochemical networks, identifying key proteins and protein-protein reactions that regulate fluctuation-driven transitions leading to pathological cellular function is an important challenge. Using large deviation theory, we develop a semianalytical method to determine how changes in protein expression and rate parameters of protein-protein reactions influence the rate of such transitions. Our formulas agree well with computationally costly direct simulations and are consistent with experiments. Our approach reveals qualitative features of key reactions that regulate stochastic transitions.

| S-EPMC5470593 | biostudies-literature

Hierarchical Decomposition for Betweenness Centrality Measure of Complex Networks.

Project description:Betweenness centrality is an indicator of a node's centrality in a network. It is equal to the number of shortest paths from all vertices to all others that pass through that node. Most of real-world large networks display a hierarchical community structure, and their betweenness computation possesses rather high complexity. Here we propose a new hierarchical decomposition approach to speed up the betweenness computation of complex networks. The advantage of this new method is its effective utilization of the local structural information from the hierarchical community. The presented method can significantly speed up the betweenness calculation. This improvement is much more evident in those networks with numerous homogeneous communities. Furthermore, the proposed method features a parallel structure, which is very suitable for parallel computation. Moreover, only a small amount of additional computation is required by our method, when small changes in the network structure are restricted to some local communities. The effectiveness of the proposed method is validated via the examples of two real-world power grids and one artificial network, which demonstrates that the performance of the proposed method is superior to that of the traditional method.

| S-EPMC5397849 | biostudies-other

Percolation transition in dynamical traffic network with evolving critical bottlenecks.

Project description:A critical phenomenon is an intrinsic feature of traffic dynamics, during which transition between isolated local flows and global flows occurs. However, very little attention has been given to the question of how the local flows in the roads are organized collectively into a global city flow. Here we characterize this organization process of traffic as "traffic percolation," where the giant cluster of local flows disintegrates when the second largest cluster reaches its maximum. We find in real-time data of city road traffic that global traffic is dynamically composed of clusters of local flows, which are connected by bottleneck links. This organization evolves during a day with different bottleneck links appearing in different hours, but similar in the same hours in different days. A small improvement of critical bottleneck roads is found to benefit significantly the global traffic, providing a method to improve city traffic with low cost. Our results may provide insights on the relation between traffic dynamics and percolation, which can be useful for efficient transportation, epidemic control, and emergency evacuation.

| S-EPMC4311803 | biostudies-other

A dynamical traffic flow model for a cognitive drivers' sensitivity in Lagrangian scope.

Project description:A new microscopic traffic flow model is established based on heterogeneous driver's sensitivity; in this new model, the driver's sensitivity is defined as being dependent on the headway distances to the preceding vehicle, similar to Bando's optimal velocity function. We introduce the formulation of this cognitive driver's sensitivity utilizing a modified form of Bando's optimal velocity function. A simple methodology, which is used for improving Bando's optimal velocity function, has been implemented for developing the cognitive driver's sensitivity function, which establishes a correlation between the flow field's density and human drivers' responses. The model is highly advanced for introducing a human-driven traffic flow field considering the driver's mental behavioral activity. Using the linear stability condition, we elucidate a neutral stability condition. A series of numerical simulations indicates how the present model describes dynamics that differ from the conventional model, which assumes a constant driver's sensitivity.

| S-EPMC9569355 | biostudies-literature

An introduction to dynamical systems.

Project description:This Teaching Resource provides lecture notes, slides, and a problem set that can assist in teaching concepts related to dynamical systems tools for the analysis of ordinary differential equation (ODE)-based models. The concepts are applied to familiar biological problems, and the material is appropriate for graduate students or advanced undergraduates. The lecture explains how equations describing biochemical signaling networks can be derived from diagrams that illustrate the reactions in graphical form. Because such reactions are most frequently described using systems of ODEs, the lecture discusses and illustrates the principles underlying the numerical solution of ODEs. Methods for determining the stability of steady-state solutions of one or two-dimensional ODE systems are covered and illustrated using standard graphical methods. The concept of a bifurcation, a condition at which a system's behavior changes qualitatively, is also introduced. A problem set is included that (i) requires students to implement an ODE model of biochemical reactions using MATLAB and (ii) allows them to explore dynamical systems concepts.

| S-EPMC4118930 | biostudies-literature

Inference for nonlinear dynamical systems.

Project description:Nonlinear stochastic dynamical systems are widely used to model systems across the sciences and engineering. Such models are natural to formulate and can be analyzed mathematically and numerically. However, difficulties associated with inference from time-series data about unknown parameters in these models have been a constraint on their application. We present a new method that makes maximum likelihood estimation feasible for partially-observed nonlinear stochastic dynamical systems (also known as state-space models) where this was not previously the case. The method is based on a sequence of filtering operations which are shown to converge to a maximum likelihood parameter estimate. We make use of recent advances in nonlinear filtering in the implementation of the algorithm. We apply the method to the study of cholera in Bangladesh. We construct confidence intervals, perform residual analysis, and apply other diagnostics. Our analysis, based upon a model capturing the intrinsic nonlinear dynamics of the system, reveals some effects overlooked by previous studies.

| S-EPMC3020138 | biostudies-literature

Memory traces in dynamical systems.

Project description:To perform nontrivial, real-time computations on a sensory input stream, biological systems must retain a short-term memory trace of their recent inputs. It has been proposed that generic high-dimensional dynamical systems could retain a memory trace for past inputs in their current state. This raises important questions about the fundamental limits of such memory traces and the properties required of dynamical systems to achieve these limits. We address these issues by applying Fisher information theory to dynamical systems driven by time-dependent signals corrupted by noise. We introduce the Fisher Memory Curve (FMC) as a measure of the signal-to-noise ratio (SNR) embedded in the dynamical state relative to the input SNR. The integrated FMC indicates the total memory capacity. We apply this theory to linear neuronal networks and show that the capacity of networks with normal connectivity matrices is exactly 1 and that of any network of N neurons is, at most, N. A nonnormal network achieving this bound is subject to stringent design constraints: It must have a hidden feedforward architecture that superlinearly amplifies its input for a time of order N, and the input connectivity must optimally match this architecture. The memory capacity of networks subject to saturating nonlinearities is further limited, and cannot exceed square root N. This limit can be realized by feedforward structures with divergent fan out that distributes the signal across neurons, thereby avoiding saturation. We illustrate the generality of the theory by showing that memory in fluid systems can be sustained by transient nonnormal amplification due to convective instability or the onset of turbulence.

| S-EPMC2596211 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data