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

@article{SerGiacomi2021LagrangianBA,
  title={Lagrangian betweenness as a measure of bottlenecks in dynamical systems with oceanographic examples},
  author={Enrico Ser-Giacomi and Alberto Baudena and Vincent Rossi and Michael J. Follows and Sophie Clayton and Ruggero Vasile and Crist{\'o}bal L{\'o}pez and Emilio Hern{\'a}ndez-Garc{\'i}a},
  journal={Nature Communications},
  year={2021},
  volume={12}
}
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… Expand

Figures from this paper

References

SHOWING 1-10 OF 67 REFERENCES
Flow networks: a characterization of geophysical fluid transport.
TLDR
This work quantitatively relate dispersion and mixing characteristics, classically quantified by Lyapunov exponents, to the degree of the network nodes and defines a family of network entropies, defined from the network adjacency matrix, related to the statistics of stretching in the fluid. Expand
Explicit and implicit network connectivity: Analytical formulation and application to transport processes.
TLDR
Theoretical framework for exact expressions for random-walk connectivity probabilities across any range of numbers of steps in a generic temporal, directed, and weighted network is derived, providing a natural framework to assess transport dynamics. Expand
Crossroads of the mesoscale circulation
Abstract Quantifying the mechanisms of tracer dispersion in the ocean remains a central question in oceanography, for problems ranging from nutrient delivery to phytoplankton, to the early detectionExpand
How reliable are finite-size Lyapunov exponents for the assessment of ocean dynamics?
Abstract Much of atmospheric and oceanic transport is associated with coherent structures. Lagrangian methods are emerging as optimal tools for their identification and analysis. An importantExpand
Lagrangian Flow Network approach to an open flow model
Abstract Concepts and tools from network theory, the so-called Lagrangian Flow Network framework, have been successfully used to obtain a coarse-grained description of transport by closed fluidExpand
Temporal Networks
TLDR
This review presents the emergent field of temporal networks, and discusses methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems. Expand
Predictability of large-scale atmospheric motions: Lyapunov exponents and error dynamics.
TLDR
It is shown in particular that the variability of the local Lyapunov exponents decreases when the model resolution increases, and the implications for operational (high resolution) atmospheric and climate modelling are discussed. Expand
Most probable paths in temporal weighted networks: An application to ocean transport.
TLDR
The relative importance of the most probable path between two nodes with respect to the whole set of paths and to a subset of highly probable paths that incorporate most of the connection probability is quantified. Expand
The dynamical systems approach to lagrangian transport in oceanic flows
▪ Abstract Chaotic advection and, more generally, ideas from dynamical systems, have been fruitfully applied to a diverse, and varied, collection of mixing and transport problems arising inExpand
Collective dynamics of ‘small-world’ networks
TLDR
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. Expand
...
1
2
3
4
5
...