相关论文: Almost isomorphism for countable state Markov shif…

We analyze a class of deformations of Anosov diffeomorphisms: these $C^0$-small, but $C^1$-macroscopic deformations break the topological conjugacy class but leave the high entropy dynamics unchanged. More precisely, there is a partial…

Let $G$ be a non-amenable countable group. We show that every almost automorphic $G$-action on a compact Hausdorff space, with a maximal equicontinuous factor whose phase space is a Cantor set, admits invariant probability measures (this…

We introduce an extension of finite mixture models by incorporating skew-normal distributions within a Hidden Markov Model framework. By assuming a constant transition probability matrix and allowing emission distributions to vary according…

This paper is a systematic study about the syndetically proximal relation and the possible existence of syndetically scrambled sets for the dynamics of continuous self-maps of compact metric spaces. Especially we consider various classes of…

We introduce the notion of balanced strong shift equivalence between square nonnegative integer matrices, and show that two finite graphs with no sinks are one-sided eventually conjugate if and only if their adjacency matrices are conjugate…

In this paper, we study consistent and partially exchangeable sequences of Markov chains on a finite state space. We provide a characterisation of the admissible transition rates via a decomposition into individual and coordinated motion of…

Let $(X_A,\sigma_A)$ be the right one-sided topological Markov shift for an irreducible matrix with entries in $\{0,1\}$, and $\Gamma_A$ the continuous full group of $(X_A,\sigma_A)$. For two irreducible matrices $A$ and $B$ with entries in…

The cutoff phenomenon is an abrupt transition from out of equilibrium to equilibrium undergone by certain Markov processes in the limit where the size of the state space tends to infinity: instead of decaying gradually over time, their…

In this article we consider the general setting of conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We deal with two classes of such systems: attracting and parabolic. The latter being…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

In this paper we show that for every congruent monotileable amenable group $G$ and for every metrizable Choquet simplex $K$, there exists a minimal $G$-subshift, which is free on a full measure set, whose set of invariant probability…

We study the pointwise perturbations of countable Markov maps with infinitely many inverse branches and establish the following continuity theorem: Let $T_k$ and $T$ be expanding countable Markov maps such that the inverse branches of $T_k$…

Thermalization is one of the most important phenomena in statistical physics. Often, the transition probabilities between different states in the phase space is or can be approximated by constants. In this case, the system can be described…

We say that a finite metric space $X$ can be embedded almost isometrically into a class of metric spaces $C$, if for every $\epsilon > 0$ there exists an embedding of $X$ into one of the elements of $C$ with the bi-Lipschitz distortion less…

We consider a two-dimensional quantum control system evolving under an entropy-increasing irreversible dynamics in the semigroup form. Considering a phenomenological approach to the dynamics, we show that the accessibility property of the…

We study symmetric random walks on finitely generated groups of orientation-preserving homeomorphisms of the real line. We establish an oscillation property for the induced Markov chain on the line that implies a weak form of recurrence.…

The Medvedev degree of a subshift is a dynamical invariant of computable origin that can be used to compare the complexity of subshifts that contain only uncomputable configurations. We develop theory to describe how these degrees can be…

This paper is concerned with the development of rigorous approximations to various expectations associated with Markov chains and processes having non-stationary transition probabilities. Such non-stationary models arise naturally in…

When modelling metapopulation dynamics, the influence of a single patch on the metapopulation depends on the number of individuals in the patch. Since the population size has no natural upper limit, this leads to systems in which there are…

The approximate uniform sampling of graph realizations with a given degree sequence is an everyday task in several social science, computer science, engineering etc. projects. One approach is using Markov chains. The best available current…