相关论文: A minicourse on entropy theory on the interval

Let $K = \{0,1,...,q-1\}$. We use a special class of translation invariant measures on $K^\mathbb{Z}$ called algebraic measures to study the entropy rate of a hidden Markov processes. Under some irreducibility assumptions of the Markov…

This paper deals with ergodic theorems for particular time-inhomogeneous Markov processes, whose the time-inhomogeneity is asymptotically periodic. Under a Lyapunov/minorization condition, it is shown that, for any measurable bounded…

By establishing Multiplicative Ergodic Theorem for commutative transformations on a separable infinite dimensional Hilbert space, in this paper, we investigate Pesin's entropy formula and SRB measures of a finitely generated random…

Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with travel times and stationary distribution. The return time entropy…

At the beggining of the 80's, H.Masur and W.Veech started the study of generic properties of interval exchange transformations proving that almost every such transformation is uniquely ergodic. About the same time, S.Novikov's school and…

The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…

The main goal of this paper is to develop an estimate for the entropy of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We present here the detailed analytical study of the entropy for the…

Content of the lectures is the following. Properties of transformations equivalent to ergodicity. Birkhoff's Theorem. Properties equivalent to weak mixing. On typical properties of transformations. Lego to construct transformations. Typical…

We study the dependence of the topological entropy of piecewise monotonic maps with holes under perturbations, for example sliding a hole of fixed size at uniform speed or expanding a hole with uniform expansion. We show that under suitable…

Entropy production is arguably the most universally applicable measure of non-equilibrium behavior, particularly for systems coupled to a heat bath. This setting encompasses driven soft matter as well as biomolecular, biochemical, and…

A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…

We refine upper bounds on the permanent saturation time of metric graphs using interval exchange transformations (IETs). Earlier results gave bounds under incommensurable edge lengths, we improve and generalize them by using the ergodic and…

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…

Experiments on particles' motion in living cells show that it is often subdiffusive. This subdiffusion may be due to trapping, percolation-like structures, or viscoelatic behavior of the medium. While the models based on trapping (leading…

We study non-uniformly expanding maps of the unit interval with a parabolic fixed point at the origin that admit an ergodic absolutely continuous invariant measure, which may be finite or infinite. By introducing a hole defined by an…

Ergodicity of random dynamical systems with a periodic measure is obtained on a Polish space. In the Markovian case, the idea of Poincar\'e sections is introduced. It is proved that if the periodic measure is PS-ergodic, then it is ergodic.…

The chaotic phenomenon of intermittency is modeled by a simple map of the unit interval, the Farey map. The long term dynamical behaviour of a point under iteration of the map is translated into a spin system via symbolic dynamics. Methods…

For a Markov chain $Y$ with values in a Polish space, consider the entrance Markov chain obtained by sampling $Y$ at the moments when it enters a fixed set $A$ from its complement $A^c$. Similarly, consider the exit Markov chain, obtained…

We consider Milnor's "tower algorithm" in the space of piecewise monotone maps, an iterative algorithm on the space of metrics which unifies, on the one hand, Thurston's iterative scheme which converges to holomorphic models, and, on the…

We study weighted ensemble, an interacting particle method for sampling distributions of Markov chains that has been used in computational chemistry since the 1990s. Many important applications of weighted ensemble require the computation…