Billiards with polynomial mixing rates
Nikolai Chernov, Hong-Kun Zhang

TL;DR
This paper develops a practical method to estimate nearly optimal polynomial mixing rates in chaotic billiards, advancing understanding of systems with slow mixing and intermittent dynamics.
Contribution
It introduces a simplified scheme for analyzing slow mixing rates in billiards, making mathematical tools more applicable to realistic models.
Findings
Successfully applied to several classes of chaotic billiards with slow mixing.
Provided bounds on mixing rates that are nearly optimal.
Identified limitations where the method does not work.
Abstract
While many dynamical systems of mechanical origin, in particular billiards, are strongly chaotic -- enjoy exponential mixing, the rates of mixing in many other models are slow (algebraic, or polynomial). The dynamics in the latter are intermittent between regular and chaotic, which makes them particularly interesting in physical studies. However, mathematical methods for the analysis of systems with slow mixing rates were developed just recently and are still difficult to apply to realistic models. Here we reduce those methods to a practical scheme that allows us to obtain a nearly optimal bound on mixing rates. We demonstrate how the method works by applying it to several classes of chaotic billiards with slow mixing as well as discuss a few examples where the method, in its present form, fails.
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.
