Related papers: Almost isomorphism for countable state Markov shif…
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…
General Markov chains with a countably additive transition probability in arbitrary phase space are considered. Markov operators extend from the space of countably additive measures to the space of finitely additive measures. In the…
We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization,…
We give conditions for when continuous orbit equivalence of one-sided shift spaces implies flow equivalence of the associated two-sided shift spaces. Using groupoid techniques, we prove that this is always the case for shifts of finite…
We introduce the concept of a Markov influence system (MIS) and analyze its dynamics. An MIS models a random walk in a graph whose edges and transition probabilities change endogenously as a function of the current distribution. This…
We establish metastability in the sense of Lebowitz and Penrose under practical and simple hypothesis for (families of) Markov chains on finite configuration space in some asymptotic regime, including the case of configuration space size…
A dynamical system may be defined by a simple transition law - such as a map or a vector field. The objective of most learning techniques is to reconstruct this dynamic transition law. This is a major shortcoming, as most dynamic properties…
We consider automorphism groups of some countably categorical structures and their precompact expansions. We prove that automorphism groups of omega-stable omega-categorical structures have metrizable universal minimal flows. We also study…
Quantum systems coupled to environments exhibit intricate dynamics. The master equation gives a Markov approximation of the dynamics, allowing for analytic and numerical treatments. It is ubiquitous in theoretical and applied quantum…
Consider a discrete time Markov chain with rather general state space which has an invariant probability measure $\mu$. There are several sufficient conditions in the literature which guarantee convergence of all or $\mu$-almost all…
Sofic groups were defined implicitly by Gromov in [Gr99] and explicitly by Weiss in [We00]. All residually finite groups (and hence every linear group) is sofic. The purpose of this paper is to introduce, for every countable sofic group…
For non-equilibrium systems described by finite Markov processes, we consider the number of times that a system traverses a cyclic sequence of states (a cycle). The joint distribution of the number of forward and backward instances of any…
The asymptotic normality in multi-dimension of the nonparametric estimator of the transition probabilities of a Markov renewal chain is proved, and is applied to that of other nonparametric estimators involved with the associated…
In this paper, we establish the quasi-compactness of the transfer operator associated with skew product systems that are semi-conjugate to piecewise convex maps with a countably infinite number of branches. These non-invertible skew…
We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification…
We study KMS states for gauge actions with potential functions on Cuntz--Krieger algebras whose underlying one-sided topological Markov shifts are continuous orbit equivalent. As a result, we have a certain relationship between topological…
The Transience objective is not to visit any state infinitely often. While this is not possible in finite Markov Decision Process (MDP), it can be satisfied in countably infinite ones, e.g., if the transition graph is acyclic. We prove the…
In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…
In this work, we characterise the statistics of Markov chains by constructing an associated sequence of periodic differential operators. Studying the density of states of these operators reveals the absolutely continuous invariant measure…
An algorithm for estimating quasi-stationary distribution of finite state space Markov chains has been proven in a previous paper. Now this paper proves a similar algorithm that works for general state space Markov chains under very general…