A fractal dimension estimate for a graph-directed IFS of non-similarities
From MaRDI portal
Publication:4270507
DOI10.1512/iumj.1999.48.1641zbMath0944.28008arXivmath/9806039MaRDI QIDQ4270507
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
Hausdorff dimension; attractor; fractal dimension; IFS; Mauldin-Williams graph; graph-directed iterated function systems; upper box counting dimension
37F50: Small divisors, rotation domains and linearization in holomorphic dynamics
28A80: Fractals
28A78: Hausdorff and packing measures
Related Items
Architectural Bias in Recurrent Neural Networks: Fractal Analysis, FRACTAL GEOMETRY OF EQUILIBRIUM PAYOFFS IN DISCOUNTED SUPERGAMES, Dimensions of locally and asymptotically self-similar spaces, Asymptotic Behavior and Synchronizability Characteristics of a Class of Recurrent Neural Networks, Contraction ratios for graph-directed iterated constructions, New type of fractal functions for the general data sets, Hyperbolic dynamics in graph-directed IFS, IFS on a metric space with a graph structure and extensions of the Kelisky-Rivlin theorem, Equilibrium paths in discounted supergames, The pointwise dimension of self-similar measures in complete metric spaces, Applications of multivalued contractions on graphs to graph-directed iterated function systems, \(p\)-adic path set fractals and arithmetic, The Hausdorff dimension of sections, An application of Edelstein's contraction principle: the attractor of a graph-directed generalized iterated function system