Related papers: Dynamical Properties of Iterated Function Systems

This paper introduces Fourier duality for a class of affine iterated function systems (IFS) T_i. These systems are determined by a finite family of contractive affine maps in R^d. Our Fourier duality applies to the resulting probability…

This paper studies a general class of Iterated Function Systems (IFS). No contractivity assumptions are made, other than the existence of some compact attractor. The possibility of escape to infinity is considered. Our present approach is…

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…

We develop the hypothesis that the dynamics of a given system may lead to the activity being constricted to a subset of space, characterized by a fractal dimension smaller than the space dimension. We also address how the response function…

We construct an example of an iterated function system on the line, consisting of linear fractional transformations, such that two of the maps share a fixed points, but the dimension of the attractor equals the conformal dimension, so that…

Superpixel segmentation has become an important research problem in image processing. In this paper, we propose an Iterative Spanning Forest (ISF) framework, based on sequences of Image Foresting Transforms, where one can choose i) a seed…

Machine learning models usually assume that a set of feature values used to obtain an output is fixed in advance. However, in many real-world problems, a cost is associated with measuring these features. To address the issue of reducing…

For fractals on Riemannian manifolds, the theory of iterated function systems often does not apply well directly, as fractal sets are often defined by relations that are multivalued or non-contractive. To overcome this difficulty, we…

Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural…

The paper introduces a technique that decomposes the dynamics of a nonlinear system about an equilibrium into low order components, which then can be used to reconstruct the full dynamics. This is a nonlinear analogue of linear modal…

A data-driven, model-free approach to modeling the temporal evolution of physical systems mitigates the need for explicit knowledge of the governing equations. Even when physical priors such as partial differential equations are available,…

As neural networks are increasingly being applied to real-world applications, mechanisms to address distributional shift and sequential task learning without forgetting are critical. Methods incorporating network expansion have shown…

This work introduces a novel tool for interactive, real-time transformations of two dimensional IFS fractals. We assign barycentric coordinates (relative to an arbitrary affine basis of $\mathbb{R}^2$) to the points that constitute the…

Efficient skill acquisition, representation, and on-line adaptation to different scenarios has become of fundamental importance for assistive robotic applications. In the past decade, dynamical systems (DS) have arisen as a flexible and…

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…

A fractal is in essence a hierarchy with cascade structure, which can be described with a set of exponential functions. From these exponential functions, a set of power laws indicative of scaling can be derived. Hierarchy structure and…

We investigate Tree Iterated Function Systems (TIFSs), which we introduce in this paper. TIFSs are the generalizations of Iterated Function Systems in which we take the maps independently at each step and each block. In this paper, we give…

This paper develops methods for analyzing periodic orbits of states of linear feedback shift registers with periodic coefficients and estimating their lengths. These shift registers are among the simplest nonlinear feedback shift registers…

While increasingly deep networks are still in general desired for achieving state-of-the-art performance, for many specific inputs a simpler network might already suffice. Existing works exploited this observation by learning to skip…

For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…