Related papers: Analytical estimation of the correlation dimension…
Investigating a model of scale-invariant random spatial network suggested by Aldous, Kendall constructed a random metric $T$ on $\mathbb{R}^d$, for which the distance between points is given by the optimal connection time, when travelling…
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…
Topological Data Analysis (TDA) uses insights from topology to create representations of data able to capture global and local geometric and topological properties. Its methods have successfully been used to develop estimations of fractal…
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…
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 characterize the existence of certain geometric configurations in the fractal percolation limit set $A$ in terms of the almost sure dimension of $A$. Some examples of the configurations we study are: homothetic copies of finite sets,…
Network complexity has been studied for over half a century and has found a wide range of applications. Many methods have been developed to characterize and estimate the complexity of networks. However, there has been little research with…
In this work, we study the fractal and multifractal properties of a family of fractal networks introduced by Gallos {\it et al.} ({\it Proc. Natl. Acad. Sci. U.S.A.}, 2007, {\bf 104}: 7746). In this fractal network model, there is a…
This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…
Most of the known methods for estimating the fractal dimension of fractal sets are based on the evaluation of a single geometric characteristic, e.g. the volume of its parallel sets. We propose a method involving the evaluation of several…
This article investigates the connectivity dimension of a graph. We introduce this concept in analogy to the metric dimension of a graph, providing a graph parameter that measures the heterogeneity of the connectivity structure of a graph.…
A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|), where lambda > 0 is the vertex activity. We show that…
Let E be a metric space. We introduce a notion of connectedness index of E, which is the Hausdor? dimension of the union of non-trivial connected components of E. We show that the connectedness index of a fractal cube E is strictly less…
In this report we present experimental results using \emph{Haussdorf-Besicovich} fractal dimension for performing morphological galaxy classification. The fractal dimension is a topological, structural and spatial property that give us…
A statistical measure of dimension is used to compute the effective average space dimension for the Internet and other graphs, based on typed edges (links) from an ensemble of starting points. The method is applied to CAIDA's ITDK data for…
We study long-range power-law correlated disorder on square and cubic lattices. In particular, we present high-precision results for the percolation thresholds and the fractal dimension of the largest clusters as function of the correlation…
We propose a fluctuation analysis to quantify spatial correlations in complex networks. The approach considers the sequences of degrees along shortest paths in the networks and quantifies the fluctuations in analogy to time series. In this…
Our first experience of dimension typically comes in the intuitive Euclidean sense: a line is one dimensional, a plane is two-dimensional, and a volume is three-dimensional. However, following the work of Mandelbrot \cite{mandelbrot},…
We propose a new method for quantitative characterization of spatial network-like patterns with loops, such as surface fracture patterns, leaf vein networks and patterns of urban streets. Such patterns are not well characterized by purely…