相关论文: A Markov chain on permutations which projects to t…
We introduce an $n$-species totally asymmetric zero range process ($n$-TAZRP) on one-dimensional periodic lattice with $L$ sites. It is a continuous time Markov process in which $n$ species of particles hop to the adjacent site only in one…
The inhomogeneous two-species TASEP on a ring is an exclusion process that describes particles of different species hopping clockwise on a ring with parameters giving the hopping rates for different species. We introduce a combinatorial…
We introduce the notion of order of magnitude reversibility (OM-reversibility) in Markov chains that are parametrized by a positive parameter $\ep$. OM-reversibility is a weaker condition than reversibility, and requires only the knowledge…
Bidirectional transport in (quasi) one-dimensional systems generically leads to cluster-formation and small particle currents. This kind of transport can be described by the asymmetric simple exclusion process (ASEP) with two species of…
An asymmetric exclusion model on an open chain with random rates for hopping particles, where overtaking is also possible, is studied numerically and by computer simulation. The phase structure of the model and the density profiles near the…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
This paper is a survey of various proofs of the so called {\em fundamental theorem of Markov chains}: every ergodic Markov chain has a unique positive stationary distribution and the chain attains this distribution in the limit independent…
A multi-species generalization of the asymmetric simple exclusion process (ASEP) is studied in ordered sequential and sub-lattice parallel updating schemes. In this model particles hop with their own specific probabilities to their…
We introduce the $q$-Hahn PushTASEP --- an integrable stochastic interacting particle system which is a 3-parameter generalization of the PushTASEP, a well-known close relative of the TASEP (Totally Asymmetric Simple Exclusion Process). The…
A sequence of real numbers (x_n) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (x_n) are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov…
We consider a strictly substochastic matrix or an stochastic matrix with absorbing states. By using quasi-stationary distributions one shows there is a canonical associated stationary Markov chain. Based upon $2-$stringing representation of…
We consider the asymmetric simple exclusion process (TASEP) on open network consisting of three consecutively coupled macroscopic chain segments with a shortcut between the tail of the first segment and the head of the third one. The model…
We fully elucidate the structure of the hierarchy of the connected operators that commute with the Markov matrix of the Totally Asymmetric Exclusion Process (TASEP). We prove for the connected operators a combinatorial formula that was…
We consider a multi-species generalization of the Asymmetric Simple Exclusion Process on an open chain, in which particles hop with their characteristic hopping rates and fast particles can overtake slow ones. The number of species is…
A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…
The article studies segmentation problem (also known as classification problem) with pairwise Markov models (PMMs). A PMM is a process where the observation process and underlying state sequence form a two-dimensional Markov chain, it is a…
It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions…
We show that the known matrix representations of the stationary state algebra of the Asymmetric Simple Exclusion Process (ASEP) can be interpreted combinatorially as various weighted lattice paths. This interpretation enables us to use the…
We study an irreducible Markov chain on the category of finite abelian $p$-groups, whose stationary measure is the Cohen-Lenstra distribution. This Markov chain arises when one studies the cokernel of a random matrix $M$, after conditioning…
The goal of this work is to formally abstract a Markov process evolving in discrete time over a general state space as a finite-state Markov chain, with the objective of precisely approximating its state probability distribution in time,…