“…As in [19], we prove concentration bounds not only for Birkhoff sums, but for a more general class of separately Lipschitz (or separately Hölder) functions on [0, 1] N , see Theorem 3.11 and Remark 3.3. Theorem 1.2 improves the moment bounds in Nicol, Pereira and Török [33] and Su [41], and implies the following bounds on large and moderate deviations: Corollary 2.1. In the notation of Theorem 1.2, for every p > 2,…”
Section: Discussionmentioning
confidence: 54%
“…Alternatively, one can use the moment bounds from [33] or [41], but these were not available when we started this project.…”
Section: 3mentioning
confidence: 99%
“…We study limit laws for nonstationary dynamical systems, a topic of very intense recent interest, see [2,3,4,5,9,13,14,15,16,20,22,23,29,33,34,38,40,41] and more.…”
We study nonstationary intermittent dynamical systems, such as compositions of a (deterministic) sequence of Pomeau-Manneville maps. We prove two main results: sharp bounds on memory loss, including the "unexpected" faster rate for a large class of measures, and sharp moment bounds for Birkhoff sums and, more generally, "separately Hölder" observables.
“…As in [19], we prove concentration bounds not only for Birkhoff sums, but for a more general class of separately Lipschitz (or separately Hölder) functions on [0, 1] N , see Theorem 3.11 and Remark 3.3. Theorem 1.2 improves the moment bounds in Nicol, Pereira and Török [33] and Su [41], and implies the following bounds on large and moderate deviations: Corollary 2.1. In the notation of Theorem 1.2, for every p > 2,…”
Section: Discussionmentioning
confidence: 54%
“…Alternatively, one can use the moment bounds from [33] or [41], but these were not available when we started this project.…”
Section: 3mentioning
confidence: 99%
“…We study limit laws for nonstationary dynamical systems, a topic of very intense recent interest, see [2,3,4,5,9,13,14,15,16,20,22,23,29,33,34,38,40,41] and more.…”
We study nonstationary intermittent dynamical systems, such as compositions of a (deterministic) sequence of Pomeau-Manneville maps. We prove two main results: sharp bounds on memory loss, including the "unexpected" faster rate for a large class of measures, and sharp moment bounds for Birkhoff sums and, more generally, "separately Hölder" observables.
“…Using φφ • F n dμ ≤ Cn −(D−2−δ)(p−γ )/p ≤ Cn −4 and following the same computations as in the proof of Corollary 3.10 of [Su19b] (we skip this here), we have…”
We obtain quenched almost sure invariance principles (with convergence rates) for random Young towers if the average measure of the tail of return times to the base of random towers decays sufficiently fast. We apply our results to some independent and identically distributed perturbations of some non-uniformly expanding maps. These imply that the random systems under study tend to a Brownian motion under various scalings.
“…ASIPs were obtained also by Castro et al [6] for convergent sequences of Anosov diffeomorphisms and expanding maps on compact Riemannian manifolds. Recently Su [38] proved a vector valued ASIP for a general class of polynomially mixing time-dependent systems. Among its many implications is a self-norming CLT for the sequential intermittent system with β * < 1/2, under a (polynomial) variance growth condition.…”
We consider time-dependent dynamical systems arising as sequential compositions of self-maps of a probability space. We establish conditions under which the Birkhoff sums for multivarate observations, given a centering and a general normalizing sequence b(N ) of invertible square matrices, are approximated by a normal distribution with respect to a metric of regular test functions. Depending on the metric and the normalizing sequence b(N ), the conditions imply that the error in the approximation decays either at the rate O(N −1/2 ) or the rate O(N −1/2 log N ), under the additional assumption that b(N ) −1 N −1/2 . The error comes with a multiplicative constant whose exact value can be computed directly from the conditions. The proof is based on an observation due to Sunklodas regarding Stein's method of normal approximation. We give applications to one-dimensional random piecewise expanding maps and to sequential, random, and quasistatic intermittent systems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.