Related papers: A fractal dimension estimate for a graph-directed …
This paper introduces a scale-invariant methodology employing \textit{Fractal Geometry} to analyze and explain the nonlinear dynamics of complex connectionist systems. By leveraging architectural self-similarity in Deep Neural Networks…
This work is aimed by the spirit of 1946 Moran's Theorem, which ensures that both the box and the Hausdorff dimensions for any attractor could be calculated as the solution of an equation involving only its similarity factors. To achieve…
Iterated function systems (IFS) can be a surprisingly useful tool for studying structure in data. Here we present results stemming from a 2013 computational study by the author using IFS. The results include fractal patterns that reveal…
It is shown that fractal dimension can be estimated seeking a solution of functional equation defined for areas of coverages of different scales. The method proposed is compared with widely known way to estimate fractal dimension via linear…
For a contractive iterated function system (IFS), it is known that there is a natural hyperbolic graph structure (augmented tree) on the symbolic space of the IFS that reflects the relationship among neighboring cells, and its hyperbolic…
This work proposes the development and study of a novel technique for the generation of fractal descriptors used in texture analysis. The novel descriptors are obtained from a multiscale transform applied to the Fourier technique of fractal…
We establish a correspondence between Pavlovian conditioning processes and fractals. The association strength at a training trial corresponds to a point in a disconnected set at a given iteration level. In this way, one can represent a…
We consider a class of planar self-affine sets which we call "box-like". A box-like self-affine set is the attractor of an iterated function system (IFS) of affine maps where the image of the unit square, [0,1]^2, under arbitrary…
A classical theorem of Hutchinson asserts that if an iterated function system acts on $\mathbb{R}^d$ by similitudes and satisfies the open set condition then it admits a unique self-similar measure with Hausdorff dimension equal to the…
The Cantor set complementary to the Devil's Staircase associated with the Circle Map has a fractal dimension d approximately equal to 0.87, a value that is universal for a wide range of maps, such results being of a numerical character. In…
We completely describe the equilibrium states of a class of potentials over the full shift which includes Falconer's singular value function for affine iterated function systems with invertible affinities. We show that the number of…
We consider the fractal characteristic of the quantum mechanical paths and we obtain for any universal class of fractons labeled by the Hausdorff dimension defined within the interval 1$ $$ < $$ $$h$$ $$ <$$ $$ 2$, a fractal distribution…
In this article we investigate the pressure function and affinity dimension for iterated function systems associated to the "box-like" self-affine fractals investigated by D.-J. Feng, Y. Wang and J.M. Fraser. Combining previous results of…
In contrast to the univariate case, several definitions are available for the notion of bounded variation for a bivariate function. This article is an attempt to study the Hausdorff dimension and box dimension of the graph of a continuous…
The box counting dimension $d_C$ and the correlation dimension $d_G$ change with the number of numerically generated points forming the attractor. At a sufficiently large number of points the fractal dimension tends to a finite value. The…
\emph{Fractal percolation} or \emph{Mandelbrot percolation} is one of the most well studied families of random fractals. In this paper we study some of the geometric measure theoretical properties (dimension of projections and structure of…
We study the collection of microsets of randomly constructed fractals, which in this paper, are referred to as Galton-Watson fractals. This is a model that generalizes Mandelbrot percolation, where Galton-Watson trees (whose offspring…
When processing high-dimensional datasets, a common pre-processing step is feature selection. Filter-based feature selection algorithms are not tailored to a specific classification method, but rather rank the relevance of each feature with…
In this paper, we study cut sets of attractors of iteration function systems (IFS) in $\mathbb{R}^d$. Under natural conditions, we show that all irreducible cut sets of these attractors are perfect sets or single points. This leads to a…
Complexity measures are designed to capture complex behavior and quantify *how* complex, according to that measure, that particular behavior is. It can be expected that different complexity measures from possibly entirely different fields…