Related papers: Algorithms generating images of attractors of gene…
We provide an overview of iterated function systems (IFS), where randomly chosen state-to-state maps are applied iteratively to a state. We aim to summarize the state of art and, where possible, identify fundamental challenges 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…
We consider the dimension and measure of typical attractors of random iterated function systems (RIFSs). We define a RIFS to be a finite set of (deterministic) iterated function systems (IFSs) acting on the same metric space and, for a…
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 investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire…
We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…
Fractal interpolation function (FIF) is a special type of continuous function which interpolates certain data set and the attractor of the Iterated function system (IFS) corresponding to the data set is the graph of the FIF. Coalescence…
In the present work, we study the attractors of iterated function systems (IFSs) on connected and compact metric spaces. We prove that the whole of the phase space of a forward minimal IFS, for which some map admits an attracting fixed…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…
Iterative Proportional Fitting (IPF), combined with EM, is commonly used as an algorithm for likelihood maximization in undirected graphical models. In this paper, we present two iterative algorithms that generalize upon IPF. The first one…
In this paper, we study cut sets of attractors of iteration function systems (IFS) in $\mathbb{R}^d$. Under natural conditions, we show that all irreducible cut sets of these attractors are perfect sets or single points. This leads to a…
In this paper, we reformulate the definition of the iterated function systems (denoted by general IFSs in this paper) and show the existence and uniqueness (in some sense) of the limit sets generated by the general IFSs, to unify the…
We study infinite graph-directed iterated function systems (GIFS) whose underlying graph is not strongly connected and has countably many vertices and edges. In addition to a summability condition for the physical potential, we provide…
We apply some methods and technique of complex dynamics to study the set of symmetries of attractors of holomorphic Iterated Function Systems (IFS), as well as relations between IFS sharing the same attractor.
This paper introduces a new class of iterated function systems (IFSs) called R-IFSs, which include both rotation/reflection maps and contraction maps. The study of R-IFSs is motivated by the recent research direction on enriching IFSs by…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
The orbit of a point $x\in X$ in a classical iterated function system (IFS) can be defined as $\{f_u(x)=f_{u_n}\circ\cdots \circ f_{u_1}(x):$ $u=u_1\cdots u_n$ is a word of a full shift $\Sigma$ on finite symbols and $f_{u_i}$ is a…
We define iteration of functions that map n-dimensional vector spaces into m-dimensional vector spaces (m at most equal to n). It happens that usual iteration and Fibonacci iterative methods become special cases of this generalized…
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 provide a novel approach to construct generative models for graphs. Instead of using the traditional probabilistic models or deep generative models, we propose to instead find an algorithm that generates the data. We achieve this using…