2009
DOI: 10.1112/s0025579309000357
|View full text |Cite
|
Sign up to set email alerts
|

Random Subsets of Self‐affine Fractals

Abstract: We find the almost sure Hausdorff and box-counting dimensions of random subsets of self-affine fractals obtained by selecting subsets at each stage of the hierarchical construction in a statistically self-similar manner.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 20 publications
0
12
0
Order By: Relevance
“…In their model the linear parts of the affine mappings are nonrandom, but the translation vectors and the number of maps are independently, randomly chosen at every step of the construction. In [13] Falconer and Miao studied random subsets of a fixed self-affine fractal. The randomness is introduced by choosing at each step of the construction a random subfamily of the original function system independently.…”
Section: Introductionmentioning
confidence: 99%
“…In their model the linear parts of the affine mappings are nonrandom, but the translation vectors and the number of maps are independently, randomly chosen at every step of the construction. In [13] Falconer and Miao studied random subsets of a fixed self-affine fractal. The randomness is introduced by choosing at each step of the construction a random subfamily of the original function system independently.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, analogous results were obtained for random affine code tree fractals [9] and for uniformly random self-similar fractals [8]. Thereby, the natural problem arises: is it possible to compute almost sure Hausdorff dimensions for subsets of random fractals like in [7][8][9], provided the subsets are defined in terms of the limit behavior of the corresponding empirical measures (say, as in Formula (5))? One more possible direction to generalize the results of the paper is the case when the distribution ν, empirical measures δ x,n and/or the scaling factors θ(i) are defined not on the set of colors Ω, but on the whole set of infinite strings Ω N .…”
Section: Examples and Discussionmentioning
confidence: 96%
“…Falconer and Miao started the investigation of random self-affine fractals [7]. They considered a random iterated function system (RIFS) generated by a finite collection of contracting affine maps S i : R n → R n and encoded by a random tree T ∞ that is defined exactly in the same manner as the random set of infinite genetic lines X ∞ above.…”
Section: Examples and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…More generally, recently affine iterated function systems (aIFSs), and scale renormalization, have proved to be successful models in a variety of applications involving more difficult scaling/renormalization limits. For aIFS measures and their support, there are relatively easy formulas, see e.g., [11,14,33].…”
Section: Aimmentioning
confidence: 99%