Timing of Transients: Quantifying Reaching Times and Transient Behavior in Complex Systems
Tim Kittel, Jobst Heitzig, Kevin Webster, Juergen Kurths

TL;DR
This paper introduces two novel metrics, Regularized Reaching Time and AUDIC, to quantify transient behavior in complex systems, addressing issues of non-invariance and interpretability, and providing early-warning signals for bifurcations.
Contribution
The paper proposes two new metrics for transient analysis, overcoming limitations of existing methods, and demonstrates their effectiveness as early-warning signals for bifurcations in complex systems.
Findings
T_{RR} captures critical slowing down as an early-warning indicator.
AUDIC measures reluctance or eagerness of trajectories to reach attractors.
Metrics reveal regularity in chaotic basin structures and sensitivity to prebifurcational changes.
Abstract
When quantifying the time spent in the transient of a complex dynamical system, the fundamental problem is that for a large class of systems the actual time for reaching an attractor is infinite. Common methods for dealing with this problem usually introduce three additional problems: non-invariance, physical interpretation, and discontinuities, calling for carefully designed methods for quantifying transients. In this article, we discuss how the aforementioned problems emerge and propose two novel metrics, Regularized Reaching Time () and Area under Distance Curve (AUDIC), to solve them, capturing two complementary aspects of the transient dynamics. quantifies the additional time (positive or negative) that a trajectory starting at a chosen initial condition needs to reach the attractor after a reference trajectory has already arrived there. A positive or negative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
