相关论文: A product formula for the TASEP on a ring
Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…
We apply the Matrix Product Ansatz to study the Totally Asymmetric Simple Exclusion Process on a ring with a generalized discrete-time dynamics depending on two hopping probabilities, $p$ and $\tilde{p}$. The model contains as special cases…
In this paper we study some conditional probabilities for the totally asymmetric simple exclusion processes (TASEP) with second class particles. To be more specific, we consider a finite system with one first class particle and $N-1$ second…
We study the totally asymmetric simple exclusion process (TASEP) on $\mathbb{Z}$ with a general initial condition and a deterministically moving wall in front of the particles. Using colour-position symmetry, we express the one-point…
We give a recursive construction of the stationary distribution of multi-type asymmetric simple exclusion processes on a finite ring or on the infinite line $Z$. The construction can be interpreted in terms of "multi-line diagrams" or…
We consider totally asymmetric simple exclusion processes with n types of particle and holes ($n$-TASEPs) on $\mathbb {Z}$ and on the cycle $\mathbb {Z}_N$. Angel recently gave an elegant construction of the stationary measures for the…
We study a sorting machine consisting of two stacks in series where the first stack has the added restriction such that entries in the stack must be in decreasing order from top to bottom. We give the basis of the class of permutations that…
In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
In the asymmetric simple exclusion process on the integers each particle waits exponential time, then with probability p it moves one step to the right if the site is unoccupied, otherwise it stays put; and with probability q=1-p it moves…
Smooth transportation has drawn the attention of many researchers and practitioners in several fields. In the present paper, we propose a modified model of a totally asymmetric simple exclusion process (TASEP), which includes multiple…
Recently James Martin introduced multiline queues, and used them to give a combinatorial formula for the stationary distribution of the multispecies asymmetric simple exclusion exclusion process (ASEP) on a circle. The ASEP is a model of…
We study combinatorial structures arising from finite-time transition probabilities of the Totally Asymmetric Simple Exclusion Process with open boundary conditions. While much of the existing combinatorial theory regarding the TASEP…
The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of $n$ sites. It is partially…
An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…
Random matrix theory (RMT) is based on two assumptions: (1) matrix-element independence, and (2) base invariance. Most of the proposed generalizations keep the first assumption and violate the second. Recently, several authors presented…
Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…
We study the distribution of entries of a random permutation matrix under a "randomized basis," i.e., we conjugate the random permutation matrix by an independent random orthogonal matrix drawn from Haar measure. It is shown that under…
We consider the problem of flexible modeling of higher order Markov chains when an upper bound on the order of the chain is known but the true order and nature of the serial dependence are unknown. We propose Bayesian nonparametric…