Related papers: Maximal escape rate for shifts
Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…
We prove a number of results concerning the Hausdorff and packing dimension of sets of points which escape (at least in average) to infinity at a given rate under non-autonomous iteration of exponential maps. In particular, we generalize…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
We consider zero-range processes in ${\mathbb{Z}}^d$ with site dependent jump rates. The rate for a particle jump from site $x$ to $y$ in ${\mathbb{Z}}^d$ is given by $\lambda_xg(k)p(y-x)$, where $p(\cdot)$ is a probability in…
We study quantum-classical escape-rate transitions for uniaxial and biaxial models with finite spins S=10 (such as Mn_12Ac and Fe_8) and S=100 by a direct numerical approach. At second-order transitions the level making a dominant…
It has been shown by explicit and exact calculation that whenever we have taken the \emph{effects of stable thermal fluctuations} the entropy product formula should \emph{not be mass-independent} nor \emph{does it quantized}. It has been…
A measure on a locally compact group is called spread out if one of its convolution powers is not singular with respect to Haar measure. Using Markov chain theory, we conduct a detailed analysis of random walks on homogeneous spaces with…
In this paper, we analyze the number of departures from an initially empty $M/M/\infty$ system in a finite time interval. We observe the system during an exponentially distributed period of time starting from the time origin. We then…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
Non-commutative black holes are characterised by a minimum mass which would result in a remnant after the Hawking evaporation ends. We numerically study the decay of neutral non-commutative black holes for up to ten spatial dimensions and…
We study the sequence entropy of rank one measure-preserving systems along subexponential sequences. We prove that the sequence entropy along a large class of sequences can be infinite using Ornstein's probabilistic constructions. Moreover,…
Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13], [14] showed how, in principle, one can explicitly compute the derivatives of the entropy rate of at…
We consider a run-and-tumble particle on a finite interval $[a,b]$ with two absorbing end points. The particle has an internal velocity state that switches between three values $v,0,-v$ at exponential times, thus incorporating positive…
Consider $ m $ copies of an irreducible, aperiodic Markov chain $ Y $ taking values in a finite state space. The asymptotics as $ m $ tends to infinity, of the first time from which on the trajectories of the $ m $ copies differ, have been…
We explore the escape dynamics in open Hamiltonian systems with multiple channels of escape continuing the work initiated in Part I. A thorough numerical investigation is conducted distinguishing between trapped (ordered and chaotic) and…
We consider an intrinsic entropy associated with a local conformal net A by the coefficients in the expansion of the logarithm of the trace of the ``heat kernel'' semigroup. In analogy with Weyl theorem on the asymptotic density…
We obtain large deviation results for non-uniformly expanding maps with non-flat singularities or criticalities and for partially hyperbolic non-uniformly expanding attracting sets. That is, given a continuous function we consider its space…
Exponential stochastic compression is the process when every second cell of an infinite chain may increase its weight merging randomly with left, right, or both neighboring cells. The total mass conservation is assumed. After that, merged…
The $\epsilon$-machine is a stochastic process' optimal model -- maximally predictive and minimal in size. It often happens that to optimally predict even simply-defined processes, probabilistic models -- including the $\epsilon$-machine --…
For an expanding (unstable) foliation of a diffeomorphism, we use a natural dynamical averaging to construct transverse measures, which we call \emph{maximal}, describing the statistics of how the iterates of a given leaf intersect the…