Computing return times or return periods with rare event algorithms
Thibault Lestang, Francesco Ragone, Charles-Edouard Br\'ehier,, Corentin Herbert, Freddy Bouchet

TL;DR
This paper introduces a novel, efficient method to estimate the return times of rare events in dynamical systems, improving accuracy and computational cost over existing approaches, with applications to stochastic processes and turbulent flows.
Contribution
The authors develop a generalized approach to accurately estimate return times of rare events using rare event sampling algorithms, reducing computational costs significantly.
Findings
Method improves return time estimates for rare events.
Approach is applicable to both instantaneous and time-averaged observables.
Demonstrated on stochastic and turbulent flow systems.
Abstract
The average time between two occurrences of the same event, referred to as its return time (or return period), is a useful statistical concept for practical applications. For instance insurances or public agency may be interested by the return time of a 10m flood of the Seine river in Paris. However, due to their scarcity, reliably estimating return times for rare events is very difficult using either observational data or direct numerical simulations. For rare events, an estimator for return times can be built from the extrema of the observable on trajectory blocks. Here, we show that this estimator can be improved to remain accurate for return times of the order of the block size. More importantly, we show that this approach can be generalised to estimate return times from numerical algorithms specifically designed to sample rare events. So far those algorithms often compute…
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.
