Related papers: Maximal escape rate for shifts

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

We present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing…

We address the extreme value problem of a one-dimensional dynamical system approaching a fixed target while constrained to avoid a fixed set which can be thought of as a small hole. The presence of the latter influences the extremal index…

Hidden Markov chains are widely applied statistical models of stochastic processes, from fundamental physics and chemistry to finance, health, and artificial intelligence. The hidden Markov processes they generate are notoriously…

In a recent paper, Melbourne and Terhesiu [Operator renewal theory and mixing rates for dynamical systems with infinite measure, Invent. Math. 189 (2012), 61-110] obtained results on mixing and mixing rates for a large class of…

A shift rule for the prefer-max De Bruijn sequence is formulated, for all sequence orders, and over any finite alphabet. An efficient algorithm for this shift rule is presented, which has linear (in the sequence order) time and memory…

We use subgroup distortion to determine the rate of escape of a simple random walk on a class of polycyclic groups, and we show that the rate of escape is invariant under changes of generating set for these groups. For metabelian groups, we…

We present a master equation approach to the \emph{narrow escape time} (NET) problem, i.e. the time needed for a particle contained in a confining domain with a single narrow opening, to exit the domain for the first time. We introduce a…

We prove a strong law of large numbers for directed last passage times in an independent but inhomogeneous exponential environment. Rates for the exponential random variables are obtained from a discretisation of a speed function that may…

We obtain a exponential large deviation upper bound for continuous observables on suspension semiflows over a non-uniformly expanding base transformation with non-flat singularities and/or discontinuities, where the roof function defining…

The escaping set I(f) of a transcendental meromorphic function f consists of all points which tend to infinity under iteration. The Eremenko-Lyubich class B consists of all transcendental meromorphic functions for which the set of finite…

We study the escape rate of a particle in a metastable potential in presence of a dissipative bath coupled to the momentum of the particle. Using the semiclassical bounce technique, we find that this rate is exponentially enhanced. In…

The ideal Penning trap consists of a uniform magnetic field and an electrostatic quadrupole potential. In the classical low-energy limit, the three characteristic eigenfrequencies of a charged particle trapped in this configuration do not…

We consider chaotic (hyperbolic) dynamical systems which have a generating Markov partition. Then, open dynamical systems are built by making one element of a Markov partition a hole through which orbits escape. We compare various estimates…

We prove that the entropy map for countable Markov shifts of finite entropy is upper semi-continuous at ergodic measures. Note that the phase space is non-compact. Applications to systems that can be coded by these shifts, such as positive…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

We prove the almost sure invariance principle with rate $o(n^{\varepsilon})$ for every $\varepsilon > 0$ for H\"older continuous observables on nonuniformly expanding and nonuniformly hyperbolic transformations with exponential tails.…

The Heisenberg limit traditionally provides a lower bound on the phase uncertainty scaling as 1/<N>, where <N> is the mean number of photons in the probe. However, this limit has a number of loopholes which potentially might be exploited,…

We define a notion of rank for words and subshifts that we call spacer rank, extending the notion of rank-one symbolic shifts of Gao and Hill. We construct infinite words of each finite spacer rank, of unbounded spacer rank, and show there…