Related papers: Weakly contractive iterated function systems and b…
Let $(X, \{w_j \}_{j=1}^m, \{p_j \}_{j=1}^m)$ ($2 \leq m < \infty$) be a contractive iterated function system (IFS), where $X$ is a compact subset of ${\Bbb{R}}^d$. It is well known that there exists a unique nonempty compact set $K$ such…
This article discusses the notion of convergence of sequences of iterated function systems. The technique of iterated function systems is one of the several methods to construct objects with fractal nature, and the fractals obtained with…
We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…
A broad range of nonlinear processes over networks are governed by threshold dynamics. So far, existing mathematical theory characterizing the behavior of such systems has largely been concerned with the case where the thresholds are…
This is the first article in a two-part series containing some results on dimension estimates for $C^1$ iterated function systems and repellers. In this part, we prove that the upper box-counting dimension of the attractor of any $C^1$…
In this paper we discuss a new method to blend fractal attractors using the code map for the IFS formed by the Hutchinson--Barnsley operators of a finite family of hyperbolic IFSs. We introduce a parameter called blending coefficient to…
We extend the weak-strong uniqueness principle for mean-field game (MFG) systems to a broad class of second-order stationary and time-dependent problems. Under standard monotonicity, growth, and coercivity assumptions on the Hamiltonian,…
So far, problems of intermittent fault (IF) detection and detectability have not been fully investigated in the multivariate statistics framework. The characteristics of IFs are small magnitudes and short durations, and consequently…
We study the minimality of almost every orbital branch of minimal iterated function systems (IFSs). We prove that this kind of minimality holds for forward and backward minimal IFSs generated by orientation-preserving homeomorphisms of the…
We adopt an operator-theoretic perspective to analyze a class of nonlinear fixed-point iterations and discrete-time dynamical systems. Specifically, we study the Krasnoselskij iteration - at the heart of countless algorithmic schemes and…
We show that for any fixed accuracy and time length $T$, a {\it finite} number of $T$-time length pieces of the complete trajectories on the global attractor are capable of uniformly approximating all trajectories within the accuracy in the…
Iterative Fast Fourier Transform methods are useful for calculating the fields in composite materials and their macroscopic response. By iterating back and forth until convergence, the differential constraints are satisfied in Fourier…
A method is proposed to compute robust inner-approximations to the backward reachable set for uncertain nonlinear systems. It also produces a robust control law that drives trajectories starting in these sets to the target set. The method…
This paper is another attempt to measure the difference between the family $A[0,1]$ of attractors for iterated function systems acting on $[0,1]$ and a broader family, the set $A_w[0,1]$ of attractors for weak iterated function systems…
This is the second part of our study of the dimension theory of $C^1$ iterated function systems (IFSs) and repellers on ${\Bbb R}^d$. In the first part we proved that the upper box-counting dimension of the attractor of any $C^1$ IFS on…
Suppose a graph-directed iterated function system consists of maps f_e with upper estimates of the form d(f_e(x),f_e(y)) <= r_e d(x,y). Then the fractal dimension of the attractor K_v of the IFS is bounded above by the dimension associated…
New results on the behaviour of the fast motion in slow-fast systems of ODEs with dependence on the fast time are given in terms of tracking of nonautonomous attractors. Under quite general assumptions, including the uniform ultimate…
We study the long-term behavior of the distribution of the solution process to the non-autonomous McKean-Vlasov stochastic delay lattice system defined on the integer set $\mathbb{Z}$. Specifically, we first establish the well-posedness of…
Non-autonomous iterated function systems are a generalization of iterated function systems. If the contractions in the system are conformal mappings, it is called a non-autonomous conformal iterated function system, and its attractor is…
For a Borel probability measure $\mu$ on $\mathbb{R}^{n}$, it is called a spectral measure if the Hilbert space $L^{2}(\mu)$ admits an orthogonal basis of exponential functions. In this paper, we study the spectrality of fractal measures…