SearcharxivSearch

arXiv · 1905.05476

Dynamics of Tipping Cascades on Complex Networks

Abstract

Tipping points occur in diverse systems in various disciplines such as ecology, climate science, economy or engineering. Tipping points are critical thresholds in system parameters or state variables at which a tiny perturbation can lead to a qualitative change of the system. Many systems with tipping points can be modeled as networks of coupled multistable subsystems, e.g. coupled patches of vegetation, connected lakes, interacting climate tipping elements or multiscale infrastructure systems. In such networks, tipping events in one subsystem are able to induce tipping cascades via domino effects. Here, we investigate the effects of network topology on the occurrence of such cascades. Numerical cascade simulations with a conceptual dynamical model for tipping points are conducted on Erd\H{o}s-R\'enyi, Watts-Strogatz and Barab\'asi-Albert networks. Additionally, we generate more realistic networks using data from moisture-recycling simulations of the Amazon rainforest and compare the results to those obtained for the model networks. We furthermore use a directed configuration model and a stochastic block model which preserve certain topological properties of the Amazon network to understand which of these properties are responsible for its increased vulnerability. We find that clustering and spatial organization increase the vulnerability of networks and can lead to tipping of the whole network. These results could be useful to evaluate which systems are vulnerable or robust due to their network topology and might help to design or manage systems accordingly.

Explore related subjects

Keep this discovery

BibTeXRIS

Jonathan Krönke, Nico Wunderling, Ricarda Winkelmann, Arie Staal, Benedikt Stumpf, Obbe A. Tuinenburg, Jonathan F. Donges. 2019-05-14. Dynamics of Tipping Cascades on Complex Networks. https://doi.org/10.1103/physreve.101.042311

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD