A fractal dimension estimate for a graph-directed IFS of non-similarities

DOI10.1512/iumj.1999.48.1641zbMath0944.28008arXivmath/9806039OpenAlexW2963636936MaRDI QIDQ4270507

G. A. Edgar, Jeffrey Golds

Publication date: 28 November 1999

Published in: Indiana University Mathematics Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9806039

zbMATH Keywords

Hausdorff dimensionattractorfractal dimensionIFSMauldin-Williams graphgraph-directed iterated function systemsupper box counting dimension

Mathematics Subject Classification ID

Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) Fractals (28A80) Hausdorff and packing measures (28A78)

Related Items

Architectural Bias in Recurrent Neural Networks: Fractal Analysis ⋮ The Hausdorff dimension of sections ⋮ An application of Edelstein's contraction principle: the attractor of a graph-directed generalized iterated function system ⋮ New type of fractal functions for the general data sets ⋮ Hyperbolic dynamics in graph-directed IFS ⋮ \(p\)-adic path set fractals and arithmetic ⋮ Contraction ratios for graph-directed iterated constructions ⋮ Equilibrium paths in discounted supergames ⋮ FRACTAL GEOMETRY OF EQUILIBRIUM PAYOFFS IN DISCOUNTED SUPERGAMES ⋮ The pointwise dimension of self-similar measures in complete metric spaces ⋮ Dimensions of locally and asymptotically self-similar spaces ⋮ Asymptotic Behavior and Synchronizability Characteristics of a Class of Recurrent Neural Networks ⋮ IFS on a metric space with a graph structure and extensions of the Kelisky-Rivlin theorem ⋮ Applications of multivalued contractions on graphs to graph-directed iterated function systems