Related papers: Dimension estimates in nonconformal graph directed…
Following the work of Louisa and Michael Barnsley on results in tops of iterated function systems, we extend their work to graph-directed iterated function systems by investigating the relationship between top addresses and shift spaces.…
In the field of graph signal processing (GSP), directed graphs present a particular challenge for the "standard approaches" of GSP to due to their asymmetric nature. The presence of negative- or complex-weight directed edges, a graphical…
We consider infinite iterated function systems $\{f_i\}_{i=1}^{\infty}$ on $[0,1]$ with a polynomially increasing contraction rate. We look at subsets of such systems where we only allow iterates $f_{i_1}\circ f_{i_2}\circ f_{i_3}\circ...$…
The notion of $\ast$-measure on a compact Hausdorff space can be defined for arbitrary continuous triangular norm $\ast$. The well-known Hutchinson-Barnsley theory deals with the iterated function systems (IFSs) of probability measures and…
We investigate the Hausdorff measure and content on a class of quasi self-similar sets that include, for example, graph-directed and sub self-similar and self-conformal sets. We show that any Hausdorff measurable subset of such a set has…
In [14], the authors developed a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS. In this paper, we extend this approach to incorporate high order approximation methods.…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
We present the asymptotic distribution theory for a class of increment-based estimators of the fractal dimension of a random field of the form g{X(t)}, where g:R\to R is an unknown smooth function and X(t) is a real-valued stationary…
Stochastic network influences complicate graph filter design by producing uncertainty in network iteration matrix eigenvalues, the points at which the graph filter response is defined. While joint statistics for the eigenvalues typically…
Geometrically frustrated assemblies where building blocks misfit have been shown to generate intriguing phenomena from self-limited growth, fiber formation, to structural complexity. We introduce a graph theory formulation of geometrically…
In this paper, we study the Hausdorff dimension of the generalized intrinsic level set with respect to the given ergodic meausre in a class of non-uniformly hyperbolic interval maps with finitely many branches.
This article presents the construction of a non-affine hypersurface on an $n$-simplex in $\mathbb{R}^n$. Additionally, fractal dimension of the graph of a non-affine multivariate real-valued fractal function is estimated under certain…
We prove Central Limit Theorems and Stein-like bounds for the asymptotic behaviour of nonlinear functionals of spherical Gaussian eigenfunctions. Our investigation combine asymptotic analysis of higher order moments for Legendre polynomials…
Suppose a graph-directed iterated function system consists of maps f_e with upper estimates of the form d(f_e(x),f_e(y)) <= r_e d(x,y). Then the fractal dimension of the attractor K_v of the IFS is bounded above by the dimension associated…
We present the main concepts and results for Graph Directed Markov Systems that have a finitely irreducible incidence matrix. We then see how these results change when the incidence matrix is not assumed to be finitely irreducible.
The increasing rate of the Birkhoff sums in the infinite iterated function systems with polynomial decay of the derivative (for example the Gauss map) is studied. For different unbounded potential functions, the Hausdorff dimensions of the…
We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…
In this paper, we define inhomogeneous Graph-Directed (GD) separation conditions for a given inhomogeneous GD Iterated Function Systems (IFS), and estimate the upper box dimension of attractors by the dimension of the condensation set and…
We construct functions $f \colon [0,1] \to [0,1]$ whose graph as a subset of $\mathbb{R}^2$ has Hausdorff dimension greater than any given value $\alpha \in (1,2)$ but conformal dimension $1$. These functions have the property that a…
The analysis of signals defined over a graph is relevant in many applications, such as social and economic networks, big data or biological networks, and so on. A key tool for analyzing these signals is the so called Graph Fourier Transform…