Related papers: On a class of one-sided Markov shifts
\noindent Consider an infinite collection of particles on the real line moving according to independent Brownian motions and such that the $i$-th particle from the left gets the drift $g_{i-1}$. The case where $g_0=1$ and $g_{i}=0$ for all…
We study continuous countably (strictly) monotone maps defined on a tame graph, i.e., a special Peano continuum for which the set containing branchpoints and endpoints has a countable closure. In our investigation we confine ourselves to…
This work focuses on a class of semi-linear functional stochastic partial differential equations with Markovian switching, in which the switching component may have finite or countably infinite states. The well-posedness of the underlying…
For a graph $G$, the $k$-colouring graph of $G$ has vertices corresponding to proper $k$-colourings of $G$ and edges between colourings that differ at a single vertex. The graph supports the Glauber dynamics Markov chain for $k$-colourings,…
This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical distribution converges to a given reference one. The Markov…
Klavik et al. [arXiv:1207.6960] recently introduced a generalization of recognition called the bounded representation problem which we study for the classes of interval and proper interval graphs. The input gives a graph G and in addition…
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…
We compute the stationary distribution of a continuous-time Markov chain which is constructed by gluing together two finite, irreducible Markov chains by identifying a pair of states of one chain with a pair of states of the other and…
We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…
Answering a question of A. Vershik we construct two non-weakly isomorphic ergodic automorphisms for which the associated unitary (Koopman) representations are Markov quasi-similar. We also discuss metric invariants of Markov…
The representation problem of finite-dimensional Markov matrices in Markov semigroups is revisited, with emphasis on concrete criteria for matrix subclasses of theoretical or practical relevance, such as equal-input, circulant, symmetric or…
We classify toric Fano threefolds having at worst terminal singularities such that a rank of a $G$-invariant part of a class group equals one, where $G$ is a group acting on the variety by automorphisms.
We construct a four-parameter family of Markov processes on infinite Gelfand-Tsetlin schemes that preserve the class of central (Gibbs) measures. Any process in the family induces a Feller Markov process on the infinite-dimensional boundary…
It is shown how a natural representation of perpetuities as asymptotically homogeneous in space Markov chains allows to prove various asymptotic tail results for stable perpetuities and limit theorems for unstable ones. Some of these…
We prove that if two nonnegative matrices are strong shift equivalent, the associated stable Cuntz-Krieger algebras with generalized gauge actions are conjugate. The proof is done by a purely functional analytic method and based on…
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
We show that expanding toral endomorphisms, together with their respective Lebesgue measure are isomorphic to 1-sided Bernoulli shifts. This result is then extended to smooth perturbations of expanding toral endomorphisms, together with…
This paper is concerned with the topological invariant of a graph given by the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We describe a degree four Markov basis for the model…
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…
We study feebly compact shift-continuous $T_1$-topologies on the symmetric inverse semigroup $\mathscr{I}_\lambda^n$ of finite transformations of the rank $\leqslant n$. It is proved that such $T_1$-topology is sequentially pracompact if…