相关论文: Lipschitz-Killing curvatures of self-similar rando…
Fractal Lipschitz-Killing curvature measures C^f_k(F,.), k = 0, ..., d, are determined for a large class of self-similar sets F in R^d. They arise as weak limits of the appropriately rescaled classical Lipschitz-Killing curvature measures…
Homogeneous random fractals form a probabilistic extension of self-similar sets with more dependencies than in random recursive constructions. For such random fractals we consider mean values of the Lipschitz-Killing curvatures of their…
We obtain fractal Lipschitz-Killing curvature-direction measures for a large class of self-similar sets F in R^d. Such measures jointly describe the distribution of normal vectors and localize curvature by analogues of the higher order mean…
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…
For self-similar fractals, the Minkowski content and fractal curvature have been introduced as a suitable limit of the geometric characteristics of its parallel sets, i.e., of uniformly thin coatings of the fractal. For some self-conformal…
For a large class of self-similar sets F in R^d analogues of the higher order mean curvatures of differentiable submanifolds are introduced, in particular, the fractal Gauss-type curvature. They are shown to be the densities of associated…
Since the recent dissertation by Steffen Winter, for certain self-similar sets $F$ the growth behaviour of the Minkowski functionals of the parallel sets $F_\varepsilon := \{x\in \mathbb R^d : d(x,F)\leq \varepsilon\}$ as $\varepsilon…
We calculate the almost sure Hausdorff dimension of uniformly random self-similar fractals. These random fractals are generated from a finite family of similarities, where the linear parts of the mappings are independent uniformly…
In some recent work, fractal curvatures C^f_k(F) and fractal curvature measures C^f_k(F, .), k = 0, ..., d, have been determined for all self-similar sets F in R^d, for which the parallel neighborhoods satisfy a certain regularity condition…
In this paper we provide an up-to-date survey on the study of Lipschitz equivalence of self-similar sets. Lipschitz equivalence is an important property in fractal geometry because it preserves many key properties of fractal sets. A…
In the present paper we define statistically self-similar sets, and, using a modification of method described K.J.Falconer find a Hausdorff dimension of a statistically self-similar set.
In this article a collection of random self-similar fractal dendrites is constructed, and their Hausdorff dimension is calculated. Previous results determining this quantity for random self-similar structures have relied on geometrical…
We consider several different models for generating random fractals including random self-similar sets, random self-affine carpets, and fractal percolation. In each setting we compute either the \emph{almost sure} or the \emph{Baire…
In this paper, we show that the Lipschitz-Killing Curvatures for the excursion sets of Arithmetic Random Waves (toral Gaussian eigenfunctions) are dominated, in the high-frequency regime, by a single chaotic component. The latter can be…
This paper studies the excursion set of a real stationary isotropic Gaussian random field above a fixed level. We show that the standardized Lipschitz-Killing curvatures of the intersection of the excursion set with a window converges in…
In this work we are interested in the self--affine fractals studied by Gatzouras and Lalley and by the author which generalize the famous general Sierpinski carpets studied by Bedford and McMullen. We give a formula for the Hausdorff…
We study the a.s. convergence of a sequence of random embeddings of a fixed manifold into Euclidean spaces of increasing dimensions. We show that the limit is deterministic. As a consequence, we show that many intrinsic functionals of the…
Investigating a model of scale-invariant random spatial network suggested by Aldous, Kendall constructed a random metric $T$ on $\mathbb{R}^d$, for which the distance between points is given by the optimal connection time, when travelling…
We consider the dimension and measure of typical attractors of random iterated function systems (RIFSs). We define a RIFS to be a finite set of (deterministic) iterated function systems (IFSs) acting on the same metric space and, for a…
The class of stochastically self-similar sets contains many famous examples of random sets, e.g. Mandelbrot percolation and general fractal percolation. Under the assumption of the uniform open set condition and some mild assumptions on the…