Related papers: Real Projective Iterated Function Systems
We investigate the use of iterated function system (IFS) models for data analysis. An IFS is a discrete dynamical system in which each time step corresponds to the application of one of a finite collection of maps. The maps, which represent…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…
In this paper we will introduce the methodology of analysis of the convex hull of the attractors of iterated functional systems (IFS) - compact fixed sets of self-similarity mapping. The method is based on a function which for a direction,…
IFS fractals - the attractors of Iterated Function Systems - have motivated plenty of research to date, partly due to their simplicity and applicability in various fields, such as the modeling of plants in computer graphics, and the design…
Iterated function systems (IFSs) are one of the most important tools for building examples of fractal sets exhibiting some kind of `approximate self-similarity'. Examples include self-similar sets, self-affine sets etc. A beautiful variant…
In this work we present iterated function systems with general measures(IFSm) formed by a set of maps $\tau_{\lambda}$ acting over a compact space $X$, for a compact space of indices, $\Lambda$. The Markov process $Z_k$ associated to the…
Consider two objects associated to the Iterated Function System (IFS) $\{1+\lambda z,-1+\lambda z\}$: the locus $\mathcal{M}$ of parameters $\lambda\in\mathbb{D}\setminus\{0\}$ for which the corresponding attractor is connected; and the…
We review the theory of semiattractors associated with non-contractive Iterated Function Systems (IFSs) and demonstrate its applications on a concrete example. In particular, we present criteria for the existence of semiattractors due to…
A simple, yet unifying method is provided for the construction of tilings by tiles obtained from the attractor of an iterated function system (IFS). Many examples appearing in the literature in ad hoc ways, as well as new examples, can be…
The fast basin of an attractor of an iterated function system (IFS) is the set of points in the domain of the IFS whose orbits under the associated semigroup intersect the attractor. Fast basins can have non-integer dimension and comprise a…
This paper is in the form of an essay. It defines fractal tops and code space structures associated with set-attractors of hyperbolic iterated function systems (IFSs). The fractal top of an IFS is associated with a certain shift invariant…
We prove an extension of M. Hata's theorem [4] for planar Markov Iterated Function Systems satisfying a strong version of the Open Set Condition. More precisely, if the attractor of such a system is connected, then it is locally connected.…
Given an iterated function system (IFS) on a complete and separable metric space $Y$, there exists a unique compact subset $X \subseteq Y$ satisfying a fixed point relation with respect to the IFS. This subset is called the attractor set,…
We introduce an harmonic analysis for iterated function systems (IFS) (X, mu) which is based on a Markov process on certain paths. The probabilities are determined by a weight function W on X. From W we define a transition operator R_W…
Iterated functions system (IFS) is defined by specifying a set of functions in a classical phase space, which act randomly on an initial point. In an analogous way, we define a quantum iterated functions system (QIFS), where functions act…
We consider iterated function systems on the real line that consist of continuous, piecewise linear functions. Under a mild separation condition, we show that the Hausdorff and box dimensions of the attractor are equal to the minimum of 1…
In this paper we consider the shadowing property for iterated function systems,(IFS). Some important result about shadowing property are extended to iterated function systems. For example, we define topological conjugacy for IFS and prove…
This study develops a comprehensive theoretical and computational framework for Random Nonlinear Iterated Function Systems (RNIFS), a generalization of classical IFS models that incorporates both nonlinearity and stochasticity. We establish…
We extend classical basis constructions from Fourier analysis to attractors for affine iterated function systems (IFSs). This is of interest since these attractors have fractal features, e.g., measures with fractal scaling dimension.…
This paper discusses predictive inference and feature selection for generalized linear models with scarce but high-dimensional data. We argue that in many cases one can benefit from a decision theoretically justified two-stage approach:…