2017
DOI: 10.1017/s0305004117000512
|View full text |Cite
|
Sign up to set email alerts
|

Inhomogeneous random coverings of topological Markov shifts

Abstract: Let $\mathscr{S}$ be an irreducible topological Markov shift, and let μ be a shift-invariant Gibbs measure on $\mathscr{S}$. Let (Xn)n ≥ 1 be a sequence of i.i.d. random variables with common law μ. In this paper, we focus on the size of the covering of $\mathscr{S}$ by the balls B(Xn, n−s). This generalises the original Dvoretzky problem by considering random coverings of fractal sets by non-homogeneously distributed balls. We compute the almost sure dimension of lim supn →+∞B(Xn, n−s) for every s ≥ 0, which … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
10
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 21 publications
1
10
0
Order By: Relevance
“…Both of these conditions are often satisfied if μ is a Gibbs measure, for instance in the setting of Seuret's paper. Moreover, in that case it is well known that Gμfalse(sfalse)=Fμfalse(sfalse)=normalΨμfalse(sfalse):=errorfalse{x;0.16emd̲μx=sfalse}for ss, where s is the value of s that maximises normalΨμfalse(sfalse), and Fμfalse(sfalse)Gμfalse(sfalse) for ss (see [, Propositions 1 and 2]). Thus in this case, the upper bound in Proposition is equal to F¯μ, and fμfalse(αfalse)=trueF¯μfalse(1/αfalse)for all α>0, that is, our bounds specialise to Seuret's result (see Figure ).…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Both of these conditions are often satisfied if μ is a Gibbs measure, for instance in the setting of Seuret's paper. Moreover, in that case it is well known that Gμfalse(sfalse)=Fμfalse(sfalse)=normalΨμfalse(sfalse):=errorfalse{x;0.16emd̲μx=sfalse}for ss, where s is the value of s that maximises normalΨμfalse(sfalse), and Fμfalse(sfalse)Gμfalse(sfalse) for ss (see [, Propositions 1 and 2]). Thus in this case, the upper bound in Proposition is equal to F¯μ, and fμfalse(αfalse)=trueF¯μfalse(1/αfalse)for all α>0, that is, our bounds specialise to Seuret's result (see Figure ).…”
Section: Resultsmentioning
confidence: 99%
“…Proof We will use the same method to prove the statement as was used by Seuret [, Proposition 5]. Let scriptDn=false{[k12n,false(k1+1false)2n)××[kd2n,false(kd+1false)2n);0.16emkjboldZfalse},and given a point x and an integer n, let Dnfalse(xfalse) be the unique DscriptDn such that xD.…”
Section: Proof Of Propositionmentioning
confidence: 99%
See 1 more Smart Citation
“…This brings us to the randomly generated limsup-sets or random covers, studied in [FW04, Dur10, JJK + 14, Per15,FJJS18,Seu18,EP18]. In this paper we will build on ideas from [Per15] to develop a new method for analysing the Hausdorff dimension of limsup-sets.…”
Section: Introductionmentioning
confidence: 99%
“…Dimensional properties of random limsup sets have been actively studied, see for example [12,15,17,18,20,23,24,26,27,29]. Combining the results of these papers, the almost sure value of dimension of random limsup sets is known in the following cases:…”
Section: Introductionmentioning
confidence: 99%