English
Related papers

Related papers: A Markov chain on permutations which projects to t…

200 papers

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…

Combinatorics · Mathematics 2007-05-23 Sylvie Corteel , Lauren K. Williams

The asymmetric simple exclusion process (ASEP) is a model for translation in protein synthesis and traffic flow; it can be defined as a Markov chain describing particles hopping on a one-dimensional lattice. In this article I give an…

Combinatorics · Mathematics 2022-02-02 Lauren K. Williams

We study a generalization of the partially asymmetric exclusion process (PASEP) in which there are $k$ species of particles of varying weights hopping right and left on a one-dimensional lattice of $n$ sites with open boundaries. In this…

Combinatorics · Mathematics 2020-01-15 Olya Mandelshtam

In this paper we consider a model of particles jumping on a row of cells, called in physics the one dimensional totally asymmetric exclusion process (TASEP). More precisely we deal with the TASEP with open or periodic boundary conditions…

Combinatorics · Mathematics 2007-05-23 Enrica Duchi , Gilles Schaeffer

The totally asymmetric simple exclusion process (TASEP) is a basic model of statistical mechanics that has found numerous applications. We consider the case of TASEP with a finite chain where particles may enter from the left and leave to…

Dynamical Systems · Mathematics 2020-06-23 Lars Grüne , Thomas Kriecherbauer , Michael Margaliot

Introduced in the late 1960's, the asymmetric exclusion process (ASEP) 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 with…

Combinatorics · Mathematics 2022-04-27 Sylvie Corteel , Lauren Williams

The PASEP (Partially Asymmetric Simple Exclusion Process) is a probabilistic model of moving particles, which is of great interest in combinatorics, since it appeared that its partition function counts some tableaux. These tableaux have…

Combinatorics · Mathematics 2023-06-22 Matthieu Josuat-Vergès

The multispecies asymmetric simple exclusion process (mASEP) is a Markov chain in which particles of different species hop along a one-dimensional lattice. This paper studies the doubly asymmetric simple exclusion process…

Combinatorics · Mathematics 2024-03-12 Yuhan Jiang

We review various combinatorial interpretations and mappings of stationary-state probabilities of the totally asymmetric, partially asymmetric and symmetric simple exclusion processes (TASEP, PASEP, SSEP respectively). In these steady…

Statistical Mechanics · Physics 2020-04-22 Anthony J. Wood , Richard A. Blythe , Martin R. Evans

Many integrable stochastic particle systems in one space dimension (such as TASEP - totally asymmetric simple exclusion process - and its various deformations, with a notable exception of ASEP) remain integrable when we equip each particle…

Probability · Mathematics 2021-03-09 Leonid Petrov

We consider the partially asymmetric simple exclusion process (PASEP) when its steady-state probability distribution function can be written in terms of a linear superposition of product measures with a finite number of shocks. In this case…

Statistical Mechanics · Physics 2010-06-10 Farhad H. Jafarpour , Somayeh Zeraati

Research in combinatorics has often explored the asymmetric simple exclusion process (ASEP). The ASEP, inspired by examples from statistical mechanics, involves particles of various species moving around a lattice. With the traditional ASEP…

Combinatorics · Mathematics 2024-11-21 David W. Ash

Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…

Numerical Analysis · Computer Science 2018-01-08 Austin R. Benson , David F. Gleich , Lek-Heng Lim

Previous work of Ayyer, Martin, and Williams gave a probabilistic interpretation of the Macdonald polynomials $P_{\lambda}(x_1,\dots,x_n;1,t)$ at $q=1$ in terms of a Markov chain called the multispecies $t$-Push TASEP, a Markov chain…

Combinatorics · Mathematics 2026-02-17 Houcine Ben Dali , Lauren Williams

A system consisting of two parallel coupled channels where particles in one of them follow the rules of totally asymmetric exclusion processes (TASEP) and in another one move as in symmetric simple exclusion processes (SSEP) is investigated…

Statistical Mechanics · Physics 2009-11-13 K. Tsekouras , A. B. Kolomeisky

Let S be a denumerable state space and let P be a transition probability matrix on S. If a denumerable set M of nonnegative matrices is such that the sum of the matrices is equal to P, then we call M a partition of P. Let K denote the set…

Probability · Mathematics 2011-03-08 Thomas Kaijser

The asymmetric simple exclusion exclusion process (ASEP) is a model of particles hopping on a one-dimensional lattice of n sites. It was introduced around 1970, and since then has been extensively studied by researchers in statistical…

Combinatorics · Mathematics 2020-01-15 Sylvie Corteel , Olya Mandelshtam , Lauren Williams

As the simplest model of transport of interacting particles in a disordered medium, we consider the asymmetric simple exclusion process (ASEP) in which particles with hard-core interactions perform biased random walks, on the supercritical…

Statistical Mechanics · Physics 2024-12-16 Chandrashekar Iyer , Mustansir Barma , Hunnervir Singh , Deepak Dhar

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…

Combinatorics · Mathematics 2021-10-07 Sylvie Corteel , Olya Mandelshtam , Lauren Williams

Consider a lattice of n sites arranged around a ring, with the $n$ sites occupied by particles of weights $\{1,2,\dots,n\}$; the possible arrangements of particles in sites thus corresponds to the $n!$ permutations in $S_n$. The…

Combinatorics · Mathematics 2021-02-02 Donghyun Kim , Lauren Williams
‹ Prev 1 2 3 10 Next ›