Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.22959 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917529431048192 |
|---|---|
| author | Allaart, Pieter Streck, Lauritz |
| author_facet | Allaart, Pieter Streck, Lauritz |
| contents | Given a self-similar set $Λ$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $Λ$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a probability vector, and label all edges of a full $M$-ary tree independently at random with a number from $\{1,2,\dots,N\}$ according to $\mathbf{p}$, where $M\geq 2$ is an arbitrary integer. Then each infinite path in the tree starting from the root receives a random label sequence which is the coding of a point in $Λ$. We let $F\subsetΛ$ denote the set of all points obtained in this way. This construction was introduced by Allaart and Jones [J. Fractal Geom. 12 (2025), 67--92], who considered the case of a homogeneous IFS on $\mathbb{R}$ satisfying the Open Set Condition (OSC) and proved non-trivial upper and lower bounds for the Hausdorff dimension of $F$. We demonstrate that under the OSC, the Hausdorff (and box-counting) dimension of $F$ is equal to the upper bound of Allaart and Jones, and extend the result to higher dimensions as well as to non-homogeneous self-similar sets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_22959 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The dimension of random subsets of self-similar sets generated by branching random walk Allaart, Pieter Streck, Lauritz Classical Analysis and ODEs 28A78 Given a self-similar set $Λ$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $Λ$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a probability vector, and label all edges of a full $M$-ary tree independently at random with a number from $\{1,2,\dots,N\}$ according to $\mathbf{p}$, where $M\geq 2$ is an arbitrary integer. Then each infinite path in the tree starting from the root receives a random label sequence which is the coding of a point in $Λ$. We let $F\subsetΛ$ denote the set of all points obtained in this way. This construction was introduced by Allaart and Jones [J. Fractal Geom. 12 (2025), 67--92], who considered the case of a homogeneous IFS on $\mathbb{R}$ satisfying the Open Set Condition (OSC) and proved non-trivial upper and lower bounds for the Hausdorff dimension of $F$. We demonstrate that under the OSC, the Hausdorff (and box-counting) dimension of $F$ is equal to the upper bound of Allaart and Jones, and extend the result to higher dimensions as well as to non-homogeneous self-similar sets. |
| title | The dimension of random subsets of self-similar sets generated by branching random walk |
| topic | Classical Analysis and ODEs 28A78 |
| url | https://arxiv.org/abs/2506.22959 |