Rigorous computation of escape times for parameter intervals in the quadratic map
Pawe{\l} Pilarczyk, Stefano Luzzatto

TL;DR
This paper rigorously computes escape times for parameter intervals in the quadratic map family, providing bounds and distribution analysis to support understanding of stochastic parameters.
Contribution
It introduces a rigorous numerical method for identifying parameter intervals with specific escape times in the quadratic map, with bounds and distribution analysis.
Findings
Identified several thousand parameter intervals with proven escape times.
Provided rigorous lower and upper bounds on the phase space width.
Analyzed the distribution of intervals in the parameter space.
Abstract
We study the quadratic family of one-dimensional maps . We conduct comprehensive numerical analysis of collections of finite orbits of the critical point, computed for intervals of parameter values using rigorous numerical methods. We use the computer to explicitly construct a collection of several thousand parameter intervals, contained in , that are proved to have a specific so-called escape time, which roughly means that some effectively computed iterate of the critical point taken over all the parameters in that interval has considerable width in the phase space. In particular, we compute a rigorous lower bound on this width, in addition to the upper bound. We investigate the effect of certain constraints imposed on the numerical computations upon the resulting collection of intervals. Additionally, we illustrate and discuss the distribution of…
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.
Taxonomy
TopicsMathematical Dynamics and Fractals · Quantum chaos and dynamical systems · Chaos control and synchronization
