Sharp Favard length of random Cantor sets
Alan Chang, Pablo Shmerkin, Ville Suomala

TL;DR
This paper investigates the decay rate of Favard length for various random planar fractals, establishing universal bounds, convergence properties, and examples with different decay behaviors.
Contribution
It proves that Favard length decay of certain random fractals is comparable to 1/log(1/r), and identifies conditions for different decay rates, including almost sure convergence and explicit limits.
Findings
Favard length decays like 1/log(1/r) for many random fractals
Favard length divided by log(1/r) converges almost surely for grid fractals
Some fractals exhibit decay like log log(1/r)/log(1/r), showing non-universality
Abstract
We show that for a large class of planar -dimensional random fractals , the Favard length of the neighborhood is comparable to , matching a universal lower bound; up to now, this was only known in expectation for a few concrete models. In particular, we show that there exist -Ahlfors regular sets with the fastest possible Favard length decay. For a wide class of planar one-dimensional "grid random fractals", including fractal percolation and its Ahlfors-regular variants, we further show that converges almost surely, and we identify the limit explicitly. Furthermore, we prove that for some -dimensional Ahlfors-regular random fractals , the Favard length of decays instead like , showing that the decay is not universal among random fractals, as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Mathematical Dynamics and Fractals · Advanced Combinatorial Mathematics
