Related papers: On a class of one-sided Markov shifts

We provide explicit expressions for the constants involved in the characterisation of ergodicity of sub-geometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation…

We will characterize topologically conjugate two-sided topological Markov shifts $(\bar{X}_A,\bar{\sigma}_A)$ in terms of the associated asymptotic Ruelle $C^*$-algebras ${\mathcal{R}}_A$ with its commutative $C^*$-subalgebras…

Consider longitudinal networks whose edges turn on and off according to a discrete-time Markov chain with exponential-family transition probabilities. We characterize when their joint distributions are also exponential families with the…

For Markov chains and Markov processes exhibiting a form of stochastic monotonicity (larger states shift up transition probabilities in terms of stochastic dominance), stability and ergodicity results can be obtained using order-theoretic…

We show that a quantum field theory A living on the line and having a group G of inner symmetries gives rise to a category GLoc A of twisted representations. This category is a braided crossed G-category in the sense of Turaev. Its degree…

Let $(\xi_n)_{n=0}^\infty$ be a nonhomogeneous Markov chain taking values from finite state-space of $\mathbf{X}=\{1,2,\ldots,b\}$. In this paper, we will study the generalized entropy ergodic theorem with almost-everywhere and…

We prove that if $G$ is a countably infinite group and $(L, \lambda)$ and $(K, \kappa)$ are probability spaces having equal Shannon entropy, then the Bernoulli shifts $G \curvearrowright (L^G, \lambda^G)$ and $G \curvearrowright (K^G,…

Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results were proved on rapidly mixing Markov chains on unconstrained,…

The current paper is dedicated to the problem of finding the number of mutually non isomorphic bipartite graphs of the type $g=\langle R_g ,C_g ,E_g \rangle$ at given $n=|R_g |$ and $m=|C_g |$, where $R_g$ and $C_g$ are the two disjoint…

It is shown that each conservative nonsingular Bernoulli shift is either of type $II_1$ or $III_1$. Moreover, in the latter case the corresponding Maharam extension of the shift is a $K$-automorphism. This extends earlier results obtained…

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…

Let $E$ be a graph-directed set associated with a di-graph $G$. Let $\mu$ be a Markov-type measure on $E$. Assuming a separation condition for $E$, we determine the exact convergence order of the $L_r$-quantization error for $\mu$. This…

Many biological and medical questions can be modeled using time-to-event data in finite-state Markov chains, with the phase-type distribution describing intervals between events. We solve the inverse problem: given a phase-type…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

We establish a simple variance inequality for U-statistics whose underlying sequence of random variables is an ergodic Markov Chain. The constants in this inequality are explicit and depend on computable bounds on the mixing rate of the…

For both continuous-time and discrete-time Markov Chains, we provide criteria for inverse problems of classical types of ergodicity: (ordinary) erogodicity, algebraic ergodicity, exponential ergodicity and strong ergodicity. Our criteria…

It is shown that transient graphs for the simple random walk do not admit a nearest neighbor transient Markov chain (not necessarily a reversible one), that crosses all edges with positive probability, while there is such chain for the…

A layered graph $G^\times$ is the Cartesian product of a graph $G = (V,E)$ with the linear graph $Z$, e.g. $Z^\times$ is the 2D square lattice $Z^2$. For Bernoulli percolation with parameter $p \in [0,1]$ on $G^\times$ one intuitively would…

In this review-type paper written at the occasion of the Oberwolfach workshop {\em One-sided vs. Two-sided stochastic processes} (february 22-29, 2020), we discuss and compare Markov properties and generalisations thereof in more…

We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…