English

Sharp Favard length of random Cantor sets

Classical Analysis and ODEs 2025-12-23 v1 Metric Geometry Probability

Abstract

We show that for a large class of planar 11-dimensional random fractals SS, the Favard length Fav(S(r))\operatorname{Fav}(S(r)) of the neighborhood S(r)S(r) is comparable to log1(1/r)\log^{-1}(1/r), 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 11-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 Fav(S(r))/log(1/r)\operatorname{Fav}(S(r))/\log(1/r) converges almost surely, and we identify the limit explicitly. Furthermore, we prove that for some 11-dimensional Ahlfors-regular random fractals SS, the Favard length of S(r)S(r) decays instead like loglog(1/r)/log(1/r)\log\log(1/r)/\log(1/r), showing that the 1/log(1/r)1/\log(1/r) decay is not universal among random fractals, as might be expected from previous results.

Cite

@article{arxiv.2512.17753,
  title  = {Sharp Favard length of random Cantor sets},
  author = {Alan Chang and Pablo Shmerkin and Ville Suomala},
  journal= {arXiv preprint arXiv:2512.17753},
  year   = {2025}
}

Comments

40 pages, 7 figures

R2 v1 2026-07-01T08:33:47.518Z