2019
DOI: 10.48550/arxiv.1909.07435
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Large deviations and central limit theorems for sequential and random systems of intermittent maps

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…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: 56%
See 4 more Smart Citations
“…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: 56%
“…Also, we found that for γ * ∈ (0, 1/2), Theorem 1.2 can be proved using memory loss with asymptotics O(n −1/γ * +1 ) as in Theorem 1.1(a), and close to optimal results can be obtained with the slightly weaker bound O n −1/γ * +1 (log n) 1/γ * from [1], as it is done in [33]. For γ * ∈ (1/2, 1) the situation is significantly more complicated.…”
Section: 3mentioning
confidence: 58%
See 3 more Smart Citations