Related papers: Invariant Measures on Stationary Bratteli Diagrams
We study the finiteness of physical measures for skew-product transformations $F$ associated with discrete-time random dynamical systems driven by ergodic Markov chains. We develop a framework, using an independent and identically…
Random metastability occurs when an externally forced or noisy system possesses more than one state of apparent equilibrium. This work investigates a class of random dynamical systems, arising from perturbing a one-dimensional piecewise…
We consider impulsive dynamical systems defined on compact metric spaces and their respective impulsive semiflows. We establish sufficient conditions for the existence of probability measures which are invariant by such impulsive semiflows.…
We study measure-theoretical aspects of torus piecewise isometries. Not much is known about this type of dynamical systems, except for the special case of one-dimensional interval exchange mappings. The last case is fundamentally different…
We study stationary ordered Bratteli diagrams and give necessary and sufficient conditions for these orders to generate a continuous Vershik map. We apply this to finding adic representations for one sided substitution subshifts. We give an…
We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an $N$-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the…
Ergodic optimization aims to single out dynamically invariant Borel probability measures which maximize the integral of a given "performance" function. For a continuous self-map of a compact metric space and a dense set of continuous…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of…
The goal of this paper is to put together several techniques in handling dynamical systems on zero-dimensional spaces, such as array representation, inverse limit representation, or Bratteli-Vershik representation. We describe how one can…
In this work, we are concerned with existence and uniqueness of invariant measures for path-dependent random diffusions and their time discretizations. The random diffusion here means a diffusion process living in a random environment…
We study the dynamics of countable groups on their respective spaces of quasimorphisms. For cohomologically non-trivial quasimorphisms we show that there are no invariant measures and classify stationary measures. Within the equivalence…
We prove existence of (at most denumerable many) absolutely continuous invariant probability measures for random one-dimensional dynamical systems with asymptotic expansion. If the rate of expansion (Lyapunov exponents) is bounded away from…
We consider a dynamics generated by families of maps whose invariant density depends on a parameter a and where a itself obeys a stochastic or periodic dynamics. For slowly varying a the long-term behavior of iterates is described by a…
In this paper we focus on Bratteli-Vershik models of general compact zero-dimensional systems with the action of a homeomorphism. An ordered Bratteli diagram is called decisive if the corresponding Vershik map prolongs in a unique way to a…
We classify invariant probability measures for non-elementary groups of automorphisms, on any compact K\"ahler surface X, under the assumption that the group contains a so-called "parabolic automorphism". We also prove that except in…
This paper is concerned with ergodic properties of inhomogeneous Markov processes. Since the transition probabilities depend on initial times, the existing methods to obtain invariant measures for homogeneous Markov processes are not…
We study a class of Markov chains that model the evolution of a quantum system subject to repeated measurements. Each Markov chain in this class is defined by a measure on the space of matrices. It is then given by a random product of…
We consider the problem of approximating the stationary distribution of an ergodic Markov chain given a set of sampled transitions. Classical simulation-based approaches assume access to the underlying process so that trajectories of…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…
We consider arbitrary orderings of the edges entering each vertex of the (downward directed) Pascal graph. Each ordering determines an adic (Bratteli-Vershik) system, with a transformation that is defined on most of the space of infinite…