相关论文: Effective Strong Dimension, Algorithmic Informatio…
We introduce the concept of effective dimension for a wide class of metric spaces that are not required to have a computable measure. Effective dimension was defined by Lutz in (Lutz 2003) for Cantor space and has also been extended to…
In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…
In this paper we use the theory of computing to study fractal dimensions of projections in Euclidean spaces. A fundamental result in fractal geometry is Marstrand's projection theorem, which shows that for every analytic set E, for almost…
A theory of resource-bounded dimension is developed using gales, which are natural generalizations of martingales. When the resource bound \Delta (a parameter of the theory) is unrestricted, the resulting dimension is precisely the…
The fractal or Hausdorff dimension is a measure of roughness (or smoothness) for time series and spatial data. The graph of a smooth, differentiable surface indexed in $\mathbb{R}^d$ has topological and fractal dimension $d$. If the surface…
We establish that constructive continued fraction dimension originally defined using $s$-gales is robust, but surprisingly, that the effective continued fraction dimension and effective (base-$b$) Hausdorff dimension of the same real can be…
We introduce appropriate definitions of dimensions in order to characterize the fractal properties of complex networks. We compute these dimensions in a hierarchically structured network of particular interest. In spite of the nontrivial…
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,…
By appropriate scaling of coupling constants a one-parameter family of ensembles of two-dimensional geometries is obtained, which interpolates between the ensembles of (generalized) causal dynamical triangulations and ordinary dynamical…
This paper provides a new model to compute the fractal dimension of a subset on a generalized-fractal space. Recall that fractal structures are a perfect place where a new definition of fractal dimension can be given, so we perform a…
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…
In this paper we introduce and study discrete analogues of Lebesgue and Hausdorff dimensions for graphs. It turned out that they are closely related to well-known graph characteristics such as rank dimension and Prague (or…
In this paper, we study Hausdorff and Fourier dimension from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity. Working in the hyperspace $\mathbf{K}(X)$ of compact subsets of $X$, with $X=[0,1]^d$ or…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
In this paper, we prove the identity $\dim_{\textrm H}(F)=d\cdot \dim_{\textrm H}(\alpha^{-1}(F))$, where $\dim_{\textrm H}$ denotes Hausdorff dimension, $F\subseteq \mathbb{R}^d$, and $\alpha:[0,1]\to [0,1]^d$ is a function whose…
Fractals are self-repeating patterns which have dimensions given by fractions rather than integers. While the dimension of a system unambiguously defines its properties, a fractional dimensional system can exhibit interesting properties.…
Hausdorff dimension results are a classical topic in the study of path properties of random fields. This article presents an alternative approach to Hausdorff dimension results for the sample functions of a large class of self-affine random…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
Fractal dimension constitutes the main tool to test for fractal patterns in Euclidean contexts. For this purpose, it is always used the box dimension, since it is easy to calculate, though the Hausdorff dimension, which is the oldest and…
We show that for a wide range of probability measures, constructive gales are interchangable with constructive supergales for defining constructive Hausdorff dimension, thus generalizing a previous independent result of Hitchcock…