相关论文: Graph Hausdorff dimension, Kolmogorov complexity a…

In this paper we study self-similar and fractal networks from the combinatorial perspective. We establish analogues of topological (Lebesgue) and fractal (Hausdorff) dimensions for graphs and demonstrate that they are naturally related to…

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…

This paper surveys work on the relation between fractal dimensions and algorithmic information theory over the past thirty years. It covers the basic development of prefix-free Kolmogorov complexity from an information theoretic point of…

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…

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…

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…

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…

The Prague dimension of graphs was introduced by Nesetril, Pultr and Rodl in the 1970s. Proving a conjecture of Furedi and Kantor, we show that the Prague dimension of the binomial random graph is typically of order n/log n for constant…

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…

Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…

This paper contains a comparative study of two families of simple curves drawn in the plane. On the one hand, we have the fractal curves on the unit interval, with self-similar structure, which have associated a Hausdorff dimension. On the…

The Prague dimension of a graph $G$ is defined as the minimum number of complete graphs whose direct product contains $G$ as an induced subgraph. Introduced in the 1970s by Ne\v{s}et\v{r}il, Pultr, and R\"odl -- and motivated by the work of…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

In this paper we propose a new model of random graph directed fractals that extends the current well-known model of random graph directed iterated function systems, $V$-variable attractors, and fractal and Mandelbrot percolation. We study…

We introduce a new concept of dimension for metric spaces, the so-called topological Hausdorff dimension. It is defined by a very natural combination of the definitions of the topological dimension and the Hausdorff dimension. The value of…

We develop a versatile framework which allows us to rigorously estimate the Hausdorff dimension of maximal conformal graph directed Markov systems in $\mathbb{R}^n$ for $n \geq 2$. Our method is based on piecewise linear approximations of…

Recently [L. Lacasa and J. G\'omez-Garde\~nes, Phys. Rev. Lett. {\bf 110}, 168703 (2013)], a fractal dimension has been proposed to characterize the geometric structure of networks. This measure is an extension to graphs of the so called…

In this paper, we present a second partial solution for the problem of cardinality calculation of the set of fractals for its subcategory of the random virtual ones. Consistent with the deterministic case, we show that for the given…

In many low-dimensional dynamical systems transport coefficients are very irregular, perhaps even fractal functions of control parameters. To analyse this phenomenon we study a dynamical system defined by a piece-wise linear map and…

The classical Hausdorff dimension of finite or countable metric spaces is zero. Recently, we defined a variant, called \emph{finite Hausdorff dimension}, which is not necessarily trivial on finite metric spaces. In this paper we apply this…