2 April 2019 in Journal of Statistical Physics
1 September 2021 in Applied and Computational Harmonic Analysis
10 January 2018 in Nonlinearity
The Birkhoff ergodic theorem asserts that time averages of a function evaluated along a trajectory of length N converge to the space average, the integral of f , as , for ergodic dynamical systems. But that convergence can be slow. Instead of uniform averages that assign equal weights to points along the trajectory, we use an average with a non-uniform distribution of weights, weighting the early and late points of the trajectory much less than those near the midpoint . We show that in quasiperiodic dynamical systems, our weighted averages converge far faster provided f is sufficiently differentiable. This result can be applied to obtain efficient numerical computation of rotation numbers, invariant densities and conjugacies of quasiperiodic systems.
11 October 2017 in Nonlinearity
The Birkhoff ergodic theorem concludes that time averages, i.e. Birkhoff averages, of a function f along a length N ergodic trajectory of a function T converge to the space average , where μ is the unique invariant probability measure. Convergence of the time average to the space average is slow. We use a modified average of by giving very small weights to the ‘end’ terms when n is near 0 or . When is a trajectory on a quasiperiodic torus and f and T are , our weighted Birkhoff average (denoted ) converges ‘super’ fast to with respect to the number of iterates N , i.e. with error decaying faster than for every integer m . Our goal is to show that our weighted Birkhoff average is a powerful computational tool, and this paper illustrates its use for several examples where the quasiperiodic set is one or two dimensional. In particular, we compute rotation numbers and conjugacies (i.e. changes of variables) and their Fourier series, often with 30-digit accuracy.
15 March 2023 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
This article presents a novel approach to analyzing quasiperiodically driven dynamical systems. It presents a holistic data-driven framework for reconstructing such a system and gaining insights into its dynamical behavior. A quasiperiodically driven dynamics has two components: 1) the quasiperiodic driving source with generating frequencies and 2) the driven nonlinear dynamics. The driving dynamics are reconstructed by accurately computing a large number of Koopman eigenfrequencies, using techniques based on the theory of reproducing kernel Hilbert space (RKHS) and from ergodic theory. Unlike Fourier analysis and dynamic mode decomposition (DMD), the proposed framework can analyze systems/signals with nondominant or absent periodic components. The driven system is next reconstructed by continuing to use the RKHS framework. As a case study, we investigate data collected from a corridor of nine consecutive signalized traffic intersections. The proposed framework provides insights into generating frequencies and associated modes, accurately reconstructs the queue lengths at the signalized intersections, and makes stable long-term forecasts. The unique contributions of this article are spread across multiple domains. It includes the novel modeling framework for quasiperiodically driven systems, a computationally efficient approach able to handle a large amount of data, utilization of true Koopman eigenfrequencies, and an illustration of the proposed approach on a corridor of signalized traffic intersections.
29 June 2022 in Nonlinearity
We investigate the computability (in the sense of computable analysis) of the topological pressure P top(ϕ) on compact shift spaces X for continuous potentials . This question has recently been studied for subshifts of finite type (SFTs) and their factors (sofic shifts). We develop a framework to address the computability of the topological pressure on general shift spaces and apply this framework to coded shifts. In particular, we prove the computability of the topological pressure for all continuous potentials on S-gap shifts, generalised gap shifts, and particular beta-shifts. We also construct shift spaces which, depending on the potential, exhibit computability and non-computability of the topological pressure. We further prove that the generalised pressure function (X, ϕ) ↦ P top(X, ϕ|
X
) is not computable for a large set of shift spaces X and potentials ϕ. In particular, the entropy map X ↦ h top(X) is computable at a shift space X if and only if X has zero topological entropy. Along the way of developing these computability results, we derive several ergodic-theoretical properties of coded shifts which are of independent interest beyond the realm of computability.