Large deviation principle for piecewise monotonic maps with density of periodic measures

We show that a piecewise monotonic map with positive topological entropy satisfies the level-2 large deviation principle with respect to the unique measure of maximal entropy under the conditions that the corresponding Markov diagram is irreducible and that the periodic measures of the map are dense in the set of ergodic measures. This result can apply to a broad class of piecewise monotonic maps, such as monotonic mod one transformations and piecewise monotonic maps with two monotonic pieces.

Dynamics of Systems with a Discontinuous Hysteresis Operator and Interval Translation Maps

We studied topological and metric properties of the so-called interval translation maps (ITMs). For these maps, we introduced the maximal invariant measure and demonstrated that an ITM, endowed with such a measure, is metrically conjugated to an interval exchange map (IEM). This allowed us to extend some properties of IEMs (e.g., an estimate of the number of ergodic measures and the minimality of the symbolic model) to ITMs. Further, we proved a version of the closing lemma and studied how the invariant measures depend on the parameters of the system. These results were illustrated by a simple example or a risk management model where interval translation maps appear naturally.

ISALT: Inference-based schemes adaptive to large time-stepping for locally Lipschitz ergodic systems

<p style='text-indent:20px;'>Efficient simulation of SDEs is essential in many applications, particularly for ergodic systems that demand efficient simulation of both short-time dynamics and large-time statistics. However, locally Lipschitz SDEs often require special treatments such as implicit schemes with small time-steps to accurately simulate the ergodic measures. We introduce a framework to construct inference-based schemes adaptive to large time-steps (ISALT) from data, achieving a reduction in time by several orders of magnitudes. The key is the statistical learning of an approximation to the infinite-dimensional discrete-time flow map. We explore the use of numerical schemes (such as the Euler-Maruyama, the hybrid RK4, and an implicit scheme) to derive informed basis functions, leading to a parameter inference problem. We introduce a scalable algorithm to estimate the parameters by least squares, and we prove the convergence of the estimators as data size increases.</p><p style='text-indent:20px;'>We test the ISALT on three non-globally Lipschitz SDEs: the 1D double-well potential, a 2D multiscale gradient system, and the 3D stochastic Lorenz equation with a degenerate noise. Numerical results show that ISALT can tolerate time-step magnitudes larger than plain numerical schemes. It reaches optimal accuracy in reproducing the invariant measure when the time-step is medium-large.</p>

Pure strictly uniform models of non-ergodic measure automorphisms

<p style='text-indent:20px;'>The classical theorem of Jewett and Krieger gives a strictly ergodic model for any ergodic measure preserving system. An extension of this result for non-ergodic systems was given many years ago by George Hansel. He constructed, for any measure preserving system, a strictly uniform model, i.e. a compact space which admits an upper semicontinuous decomposition into strictly ergodic models of the ergodic components of the measure. In this note we give a new proof of a stronger result by adding the condition of purity, which controls the set of ergodic measures that appear in the strictly uniform model.</p>

The number of ergodic measures for transitive subshifts under the regular bispecial condition

If $\mathcal {A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal {A}^{\mathbb {N}}$ of sequences with entries in $\mathcal {A}$ , along with the left shift operator S. Closed S-invariant subsets are called subshifts and arise naturally as encodings of other systems. In this paper, we study the number of ergodic measures for transitive subshifts under a condition (‘regular bispecial condition’) on the possible extensions of words in the associated language. Our main result shows that under this condition, the subshift can support at most $({K+1})/{2}$ ergodic measures, where K is the limiting value of $p(n+1)-p(n)$ , and p is the complexity function of the language. As a consequence, we answer a question of Boshernitzan from 1984, providing a combinatorial proof for the bound on the number of ergodic measures for interval exchange transformations.