Related papers: Fractal Dimension for Fractal Structures
The light scattering experiment establishes a relationship between refractive index fluctuations and fractal dimension in weakly scattering tissue-like media. Based on the box-counting approach, an analytical model is developed and shows…
Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions…
There are many research papers dealing with fractal dimension of real-valued fractal functions in the recent literature. The main focus of the present paper is to study fractal dimension of complex-valued functions. This paper also…
Assuming a fractal distribution of matter in the universe, consequences that follow from the General Theory of Relativity and the Copernican Principle for fractal cosmology are examined. The change in perspective necessary to deal with a…
In this paper, we study the fractal dimension of the graph of a fractal transformation and also determine the quantization dimension of a probability measure supported on the graph of the fractal transformation. Moreover, we estimate the…
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…
In this paper, we discuss the Higuchi algorithm which serves as a widely used estimator for the box-counting dimension of the graph of a bounded function $f : [0,1] \to \R$. We formulate the method in a mathematically precise way and show…
Dimension profiles were introduced by Falconer and Howroyd to provide formulae for the box-counting and packing dimensions of the orthogonal projections of a set E or a measure on Euclidean space onto almost all m-dimensional subspaces. The…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…
The aim of this paper is to find an upper bound for the box-counting dimension of uniform attractors for non-autonomous dynamical systems. Contrary to the results in literature, we do not ask the symbol space to have finite box-counting…
Fractal structures naturally emerge in quantum systems whose initial states exhibit spatial discontinuities, a phenomenon first identified by Berry in the paradigmatic case of a particle confined in an infinite potential well. While…
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…
We analyze the fractal dimension of open clusters using 3D spatial data from Gaia DR3 for 93 open clusters from Pang et al. (2024) and 127 open clusters from Hunt & Reffert (2024) within 500 pc. The box-counting method is adopted to…
In this paper we present a method for constructing the continuous best fractal approximation in the space of bounded functions. We construct the finite-dimensional subspace of the space of bounded functions whose base consists of the…
We establish a Minkowski measurability criterion for a large class of relative fractal drums (or, in short, RFDs), in Euclidean spaces of arbitrary dimension in terms of their complex dimensions, which are defined as the poles of their…
We investigate the geometry of a critical system undergoing a second order thermal phase transition. Using a local description for the dynamics characterizing the system at the critical point T=Tc, we reveal the formation of clusters with…
This work joins aspects of reservoir optimization, information-theoretic optimal encoding, and at its center fractal analysis. We build on the observation that, due to the recursive nature of recurrent neural networks, input sequences…
For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…
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…
A method is described for calculating the approximate fractal dimension from a set of N values y sampled from a waveform between time zero and t. The waveform was subjected to a double linear transformation that maps it into a unit square.