Related papers: A fractal dimension estimate for a graph-directed …
We derive the multifractal analysis of the conformal measure (or equivalently, the invariant measure) associated to a family of weights imposed upon a (multi-dimensional) graph directed Markov system (GDMS) using balls as the filtration.…
Let $G_n$ be a random geometric graph with vertex set $[n]$ based on $n$ i.i.d.\ random vectors $X_1,\ldots,X_n$ drawn from an unknown density $f$ on $\R^d$. An edge $(i,j)$ is present when $\|X_i -X_j\| \le r_n$, for a given threshold…
To help understand the underlying mechanisms of neural networks (NNs), several groups have, in recent years, studied the number of linear regions $\ell$ of piecewise linear functions generated by deep neural networks (DNN). In particular,…
Let $\Phi = \{\phi_e\}_{e\in E}$ be a finitely irreducible conformal graph directed Markov system (CGDMS) with symbolic representation $E_A^{\infty}$ and limit set $J$. Under a mild condition on the system, we give a multifractal analysis…
The self-similar structure of the attracting subshift of a primitive substitution is carried over to the limit set of the repelling tree in the boundary of Outer Space of the corresponding irreducible outer automorphism of a free group.…
Fractal structure of the six-vertex model is introduced with the use of the IFS (Iterated Function Systems). The fractal dimension satisfies an equation written by the free energy of the six-vertex model. It is pointed out that the transfer…
We provide a rigorous study on dimensions of fractal interpolation function defined on a closed and bounded interval of $\mathbb{R}$ which is associated to a continuous function with respect to a base function, scaling functions and a…
We introduce two frameworks in order to deal with fractal and multi-fractal analysis for subset sum problems where some embedding into the $1$-dimensional Euclidean space plays an important role. As one of these frameworks, the notion of…
Non-autonomous iterated function systems are a generalization of iterated function systems. If the contractions in the system are conformal mappings, it is called a non-autonomous conformal iterated function system, and its attractor is…
This work proposes a novel technique for the numerical calculus of the fractal dimension of fractal objects which can be represented as a closed contour. The proposed method maps the fractal contour onto a complex signal and calculates its…
The interstellar medium seems to have an underlying fractal structure which can be characterized through its fractal dimension. However, interstellar clouds are observed as projected two-dimensional images, and the projection of a…
Fractal geometry proved to be an effective mathematical tool for exploring real geographical space based on digital maps and remote sensing images. Whether the fractal theory tool can be applied to abstract geographical space has not been…
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…
We construct meta-intransitive systems of independent random variables of any finite order from basic tuple of random variables which generalize intransitive dice. Under this construction, the equality of some linear functional is…
We study the topological properties of attractors of Iterated Function Systems (I.F.S.) on the real line, consisting of affine maps of homogeneous contraction ratio. These maps define what we call a second generation I.F.S.: they are…
We consider B\'ezier curves with complex parameters, and we determine explicitly the affine iterated function system (IFS) corresponding to the de Casteljau subdivision algorithm, together with the complex parametric domain over which such…
For a self-similar set in $\mathbb{R}^d$ that is the attractor of an iterated function system that does not verify the weak separation property, Fraser, Henderson, Olson and Robinson showed that its Assouad dimension is at least $1$. In…
We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle $\mathbb{S}$ and the smallest distance to an integer $\|\cdot\|$ we give elementary proofs that the set $F(c) = \{x \in \mathbb{S}:…
In this brief report, we present a disordered version of recursive networks. Depending on the structural parameters $u$ and $v$, the networks are either fractals with a finite fractal dimension $d_{f}$ or transfinite fractals (transfractal)…
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…