arXiv · 2505.04801
Mean Minkowski content and mean fractal curvatures of random self-similar code tree fractals
Abstract
We consider a class of random self-similar fractals based on code trees which includes random recursive, homogeneous and V-variable fractals and many more. For such random fractals we consider mean values of the Lipschitz-Killing curvatures of their parallel sets for small parallel radii. Under the uniform strong open set condition and some further geometric assumptions we show that rescaled limits of these mean values exist as the parallel radius tends to 0. Moreover, integral representations are derived for these limits which recover and extend those known in the deterministic case and certain random cases. Results on the mean Minkowski content are included as a special case and shown to hold under weaker geometric assumptions.
Explore related subjects
Keep this discovery
Jan Rataj, Steffen Winter, Martina Zähle. 2025-05-07. Mean Minkowski content and mean fractal curvatures of random self-similar code tree fractals. https://arxiv.org/abs/2505.04801
Cite the original work for its findings. Save a collection to share your selection of sources.