Related papers: The discrete charm of iterated function systems. A…
Measures generated by Iterated Function Systems composed of uncountably many one--dimensional affine maps are studied. We present numerical techniques as well as rigorous results that establish whether these measures are absolutely or…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…
We discuss the problem of bounding the Fourier transforms of stationary measures of iterated function systems (IFSs) and how the pseudo-randomness of the IFS either due to arithmetic, algebraic or geometric reasons is reflected in the…
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…
We investigate the set of invariant idempotent probabilities for countable idempotent iterated function systems (IFS) defined in compact metric spaces. We demonstrate that, with constant weights, there exists a unique invariant idempotent…
We introduce the discrete version of the Hutchinson--Barnsley theory providing algorithms to approximate the Hutchinson measure for iterated function systems (IFS) and generalized iterated function systems (GIFS) complementing the discrete…
We present algorithms to compute approximations of invariant measures and its attractors for IFS and GIFS, using the deterministic algorithm in a tractable way, with code optimization strategies and use of data structures and search…
We give a systematic account of iterated function systems (IFS) of weak contractions of different types (Browder, Rakotch, topological). We show that the existence of attractors and asymptotically stable invariant measures, and the validity…
We study new relations between countable iterated function systems (IFS) with overlaps, Smale endomorphisms and random systems with complete connections. We prove that stationary measures for countable conformal IFS with overlaps and…
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…
In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…
We examine two questions regarding Fourier frequencies for a class of iterated function systems (IFS). These are iteration limits arising from a fixed finite families of affine and contractive mappings in $\br^d$, and the ``IFS'' refers to…
We consider iterated functions systems (IFS) on compact metric spaces and introduce the concept of target sets. Such sets have very rich dynamical properties and play a similar role as semifractals introduced by Lasota and Myjak do for…
We study the moments of equilibrium measures for iterated function systems (IFSs) and draw connections to operator theory. Our main object of study is the infinite matrix which encodes all the moment data of a Borel measure on R^d or C. To…
We consider some random iterated function systems on the interval and show that the invariant measure has density in $\mathcal{C}^\infty$. To prove this we use some techniques for contractions in cone metrics, applied to the transfer…
We study contraction conditions for an iterated function system of continuous maps on a metric space which are chosen randomly, identically and independently. We investigate metric changes, preserving the topological structure of the space,…
We investigate iterated function systems (IFS) that randomly alternate between two non-identical one-dimensional maps. Our primary focus is on finite invariant sets exhibiting ``toss-and-catch'' dynamics, in which trajectories alternate…
In this paper, we propose an approach for computing invariant sets of discrete-time nonlinear systems by lifting the nonlinear dynamics into a higher dimensional linear model. In particular, we focus on the \emph{maximal admissible…
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…
We study the attractor of Iterated Function Systems composed of infinitely many affine, homogeneous maps. In the special case of second generation IFS, defined herein, we conjecture that the attractor consists of a finite number of…