2014
DOI: 10.1007/978-3-662-43920-3_11
|View full text |Cite
|
Sign up to set email alerts
|

The Geometry of Fractal Percolation

Abstract: Abstract. A well studied family of random fractals called fractal percolation is discussed. We focus on the projections of fractal percolation on the plane. Our goal is to present stronger versions of the classical Marstrand theorem, valid for almost every realization of fractal percolation. The extensions go in three directions:• the statements work for all directions, not almost all,• the statements are true for more general projections, for example radial projections onto a circle, • in the case dim H > 1, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 20 publications
0
11
0
Order By: Relevance
“…There has been great interest recently in identifying classes of sets, in particular classes of self-similar sets and their variants, for which these various inequalities hold for all, rather than just almost all, subspaces. Several papers establish (1.1) for all projections for classes of self-similar sets [8,10,21,25] and for percolation on self-similar sets [7,22,23,24,26]. Here we consider dimensions of sections, and identify sets for which (1.4), or a similar inequality for box-counting dimension, holds for all subspaces V .…”
Section: Introductionmentioning
confidence: 98%
“…There has been great interest recently in identifying classes of sets, in particular classes of self-similar sets and their variants, for which these various inequalities hold for all, rather than just almost all, subspaces. Several papers establish (1.1) for all projections for classes of self-similar sets [8,10,21,25] and for percolation on self-similar sets [7,22,23,24,26]. Here we consider dimensions of sections, and identify sets for which (1.4), or a similar inequality for box-counting dimension, holds for all subspaces V .…”
Section: Introductionmentioning
confidence: 98%
“…, µ 0 -almost everywhere. Moreover, we deduce from Theorem 3.2(2) and the proof of Proposition 8.12 that for π * µ 0 -almost every x, for µ x 0 -almost every y, we 56 have both…”
Section: Now Let Us Make a Few Remarksmentioning
confidence: 76%
“…The topological properties of Mandelbrot percolation have been extensively studied, see [3,6,34]. In particular, there is a critical probability p c with 1/M < p c < 1 such that if p > p c then, conditional on non-extinction, E p contains many connected components, so its projections onto all lines necessarily have positive Lebesgue measure.…”
Section: Projections Of Percolation Setsmentioning
confidence: 99%
“…If p ≤ p c the percolation set E p is totally disconnected, and Marstrand's theorems provide information on its projections in almost all directions. However, Rams and Simon [33,34,35] recently showed using a careful geometrical analysis that, conditional on E p = / 0, almost surely the conclusions of Theorem 1.1 hold for all projections simultaneously.…”
Section: Projections Of Percolation Setsmentioning
confidence: 99%
See 1 more Smart Citation