Related papers: On the Mathematical Validity of the Higuchi Method
Research on fractal networks is a dynamically growing field of network science. A central issue is to analyze fractality with the so-called box-covering method. As this problem is known to be NP-hard, a plethora of approximating algorithms…
Under certain continuity conditions, we estimate upper and lower box dimension of graph of a function defined on the Sierpinski gasket. We also give an upper bound for Hausdorff dimension and box dimension of graph of function having finite…
An algorithm for calculating generalized fractal dimension of a time series using the general information function is presented. The algorithm is based on a strings sort technique and requires $O(N \log_2 N)$ computations. A rough estimate…
This document offers a concise introduction to the mathematical theory and practical application of the Hausdorff Measure and Dimension. The primary objective is to clarify and rigorously detail the two most common methods used for…
The subject of this note is the mixed Katugampola fractional integral of a bivariate function defined on a rectangular region in the Cartesian plane. This is a natural extension of the Katugampola fractional integral of a univariate…
We study geometrical representation of oscillatory integrals with an analytic phase function and a smooth amplitude with compact support. Geometrical properties of the curves defined by the oscillatory integral depend on the type of a…
The Hausdorff dimension of the graphs of the functions in H\"older and Besov spaces (in this case with integrability p \geq 1) on fractal d-sets is studied. Denoting by s \in (0,1] the smoothness parameter, the sharp upper bound…
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…
There are many research available on the study of real-valued fractal interpolation function and fractal dimension of its graph. In this paper, our main focus is to study the dimensional results for vector-valued fractal interpolation…
We compare different partitioning schemes for the box-counting algorithm in the multifractal analysis by computing the singularity spectrum and the distribution of the box probabilities. As model system we use the Anderson model of…
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…
Let $f$ be a generalized affine recurrent fractal interpolation function with vertical scaling functions. In this paper, by introducing underlying local iterated function systems of $f$, we define restricted vertical scaling matrices. Then…
Fractal nests are sets defined as unions of unit $n$-spheres scaled by a sequence of $k^{-\alpha}$ for some $\alpha>0$. In this article we generalise the concept to subsets of such spheres and find the formulas for their box counting…
Least box number coverage problem for calculating dimension of fractal networks is a NP-hard problem. Meanwhile, the time complexity of random ball coverage for calculating dimension is very low. In this paper we strictly present the upper…
We estimate the bounds of box-counting dimension of hidden variable fractal interpolation functions (HVFIFs) and hidden variable bivariate fractal interpolation functions (HVBFIFs) with four function contractivity factors and present…
We study various measure theories using the classical approach and then compute the Hausdorff dimension of some simple objects and self-similar fractals. We then develop a nonstandard approach to these measure theories and examine the…
Fibonacci word fractals are a class of fractals that have been studied recently, though the word they are generated from is more widely studied in combinatorics. The Fibonacci word can be used to draw a curve which possesses…
We study a wide class of fractal interpolation functions in a single platform by considering the domains of these functions as general attractors. We obtain lower and upper bounds of the box dimension of these functions in a more general…
In the following, bypassing dynamical systems tools, we propose a simple means of computing the box dimension of the graph of the classical Weierstrass function defined, for any real number~$x$, by~$ {\cal W}(x)=\displaystyle…
We show that when the standard techniques for calculating fractal dimensions in empirical data (such as the box counting) are applied on uniformly random structures, apparent fractal behavior is observed in a range between physically…