Related papers: Random Chain Recurrent Sets for Random Dynamical S…
A recent generalization of the Conley index to discrete multivalued dynamical systems without a continuous selector is motivated by applications to data-driven dynamics. In the present paper we continue the program by studying…
Let $(X,d)$ be a compact metric space and $(X,\mathcal{A},\mu,T)$ a measure preserving dynamical system. Furthermore, given a real, positive function $\psi$, let $W(T, \psi)$ and $ R(T,\psi) $ respectively denote the shrinking target set…
In renormalized field theories there are in general one or few fixed points which are accessible by the renormalization-group flow. They can be identified from the fixed-point equations. Exceptionally, an infinite family of fixed points…
For diffeomorphisms or for non-singular flows, there are many results relating properties persistent under C1 perturbations and global structures for the dynamics ( such as hyperbolicity, partial hyperbolicity, dominated splitting).…
We consider Markov chains that obey the following general non-linear state space model: $\Phi_{k+1} = F(\Phi_k, \alpha(\Phi_k, U_{k+1}))$ where the function $F$ is $C^1$ while $\alpha$ is typically discontinuous and $\{U_k: k \in…
The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how…
Let 0-CR denote the class of all metric compacta X such that the set of maps $f:X\to X$ with 0-dimensional sets CR(f) of chain recurrent points is a dense $G_\delta$-subset of the mapping space C(X,X) (with the uniform convergence). We…
We introduce a model for random chain complexes over a finite field. The randomness in our complex comes from choosing the entries in the matrices that represent the boundary maps uniformly over $\mathbb{F}_q$, conditioned on ensuring that…
We examine the question whether random set attractors for continuous-time random dynamical systems on a connected state space are connected. In the deterministic case, these attractors are known to be connected. In the probabilistic setup,…
A succesful method to describe the asymptotic behavior of a discrete time stochastic process governed by some recursive formula is to relate it to the limit sets of a well chosen mean differential equation. Under an attainability condition,…
In [1] it is shown that recurrent neural networks (RNNs) can learn - in a metric entropy optimal manner - discrete time, linear time-invariant (LTI) systems. This is effected by comparing the number of bits needed to encode the…
This paper establishes a nonlinear separation principle based on contraction theory and derives sharp stability conditions for recurrent neural networks (RNNs). First, we introduce a nonlinear separation principle that guarantees global…
Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…
This paper derives a differential contraction condition for the existence of an orbitally-stable limit cycle in an autonomous system. This transverse contraction condition can be represented as a pointwise linear matrix inequality (LMI),…
We consider consistent particle systems, which include independent random walkers, the symmetric exclusion and inclusion processes, as well as the dual of the KMP model. Consistent systems are such that the distribution obtained by first…
Using ideas borrowed from topological dynamics and ergodic theory we introduce topological and metric versions of the recurrence property for general Markov chains. The main question of interest here is how large is the set of recurrent…
We study nonautonomous discrete dynamical systems with randomly perturbed trajectories. We suppose that such a system is generated by a sequence of continuous maps which converges uniformly to a map $f$. We give conditions, under which a…
There are lots of results to study dynamical complexity on irregular sets and level sets of ergodic average from the perspective of density in base space, Hausdorff dimension, Lebesgue positive measure, positive or full topological entropy…
This paper provides a systematic yet accessible presentation of the Contextuality-by-Default theory. The consideration is confined to finite systems of categorical random variables, which allows us to focus on the basics of the theory…
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no…