Related papers: Algorithmic interpretations of fractal dimension
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
We consider approximation of functions of $s$ variables, where $s$ is very large or infinite, that belong to weighted anchored spaces. We study when such functions can be approximated by algorithms designed for functions with only very…
Scalable frames are frames with the property that the frame vectors can be rescaled resulting in tight frames. However, if a frame is not scalable, one has to aim for an approximate procedure. For this, in this paper we introduce three…
Using geometric inversion with respect to the origin we extend the definition of box dimension to the case of unbounded subsets of Euclidean spaces. Alternative but equivalent definition is provided using stereographic projection on the…
We characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…
We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…
We study the kinetics of random sequential adsorption of a mixture of particles with continuous distribution of sizes for different deposition rules. It appears in the long time limit the resulting system can be described using the fractal…
Fractal-like structures of varying complexity are common in nature, and measure-based dimensions (Minkowski, Hausdorff) supply their basic geometric characterization. However, at the level of fundamental dynamics, which is quantum,…
Let $X$ be a set of $n$ points of norm at most $1$ in the Euclidean space $R^k$, and suppose $\varepsilon>0$. An $\varepsilon$-distance sketch for $X$ is a data structure that, given any two points of $X$ enables one to recover the square…
Our goal in this paper is to develop an effective estimator of fractal dimension. We survey existing ideas in dimension estimation, with a focus on the currently popular method of Grassberger and Procaccia for the estimation of correlation…
In many real complex networks, the fractal and self-similarity properties have been found. The fractal dimension is a useful method to describe fractal property of complex networks. Fractal analysis is inadequate if only taking one fractal…
This paper presents a comprehensive introduction to the Hausdorff measure, a fundamental tool in fractal geometry and geometric measure theory. We begin by defining the Hausdorff outer measure on subsets of metric spaces, followed by a…
This paper investigates fractal dimension of linear combination of fractal continuous functions with the same or different fractal dimensions. It has been proved that: (1) $BV_{I}$ all fractal continuous functions with bounded variation is…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
The Hausdorff fractal dimension has been a fast-to-calculate method to estimate complexity of fractal shapes. In this work, a modified version of this fractal dimension is presented in order to make it more robust when applied in estimating…
Fractal percolation exhibits a dramatic topological phase transition, changing abruptly from a dust-like set to a system spanning cluster. The transition points are unknown and difficult to estimate. In many classical percolation models the…
Fractals are defined as geometric shapes that exhibit symmetry of scale. This simply implies that fractal is a shape that it would still look the same even if somebody could zoom in on one of its parts an infinite number of times. This…
Observations of galaxies over large distances reveal the possibility of a fractal distribution of their positions. The source of fractal behavior is the lack of a length scale in the two body gravitational interaction. However, even with…
Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the…
Fractal scaling--a power-law behavior of the number of boxes needed to tile a given network with respect to the lateral size of the box--is studied. We introduce a new box-covering algorithm that is a modified version of the original…