English
Related papers

Related papers: Stammering tableaux

200 papers

We formulate and analyze the steady-state behavior of totally asymmetric simple exclusion processes (TASEPs) that contain periodically varying movement rates. In our models, particles at a majority sites hop to the right with rate $p_1$…

Statistical Mechanics · Physics 2007-05-23 Greg Lakatos , Tom Chou , Anatoly Kolomeisky

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

Based on the matrix ansatz of Derrida, Evans, Hakim and Pasquier, we prensent a new way of computing the stationary probability of a state of the asym- metric simple exclusion process (ASEP). Through an insertion algorithm over staircase…

Combinatorics · Mathematics 2017-11-15 Patxi Laborde-Zubieta

We introduce and study several random combinatorial billiard trajectories. Such a system, which depends on a fixed parameter $p\in(0,1)$, models a beam of light that travels in a Euclidean space, occasionally randomly reflecting off of a…

Probability · Mathematics 2024-06-13 Colin Defant

In this paper, we study staircase tableaux, a combinatorial object introduced due to its connections with the asymmetric exclusion process (ASEP) and Askey-Wilson polynomials. Due to their interesting connections, staircase tableaux have…

Combinatorics · Mathematics 2015-09-21 Pawel Hitczenko , Amanda Lohss

We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…

Combinatorics · Mathematics 2011-01-20 Matthieu Josuat-Vergès

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…

Statistical Mechanics · Physics 2009-10-31 M. E. Fouladvand , F. Jafarpour

The Totally Asymmetric Simple Exclusion Process (TASEP) is a non-equilibrium particle model on a finite one-dimensional lattice with open boundaries. In our earlier paper, we obtained a determinantal formula that computes the steady state…

Combinatorics · Mathematics 2015-03-09 Olya Mandelshtam

Type-B permutation tableaux are combinatorial objects introduced by Lam and Williams that have an interesting connection with the partially asymmetric simple exclusion process (PASEP). In this paper, we compute the expected value of several…

Combinatorics · Mathematics 2021-02-08 Ryan Althoff , Daniel Diethrich , Amanda Lohss , Xin-Dee Low , Emily Wichert

The TASEP (totally asymmetric simple exclusion process) is a basic model for an one-dimensional interacting particle system with non-reversible dynamics. Despite the simplicity of the model it shows a very rich and interesting behaviour. In…

Probability · Mathematics 2010-03-30 James Martin , Philipp Schmidt

By generalizing the algebra of operators of the Asymmetric Simple Exclusion Process (ASEP), a multi-species ASEP in which particles can overtake each other,is defined on both open and closed one dimensional chains. On the ring the steady…

Condensed Matter · Physics 2009-10-31 V. karimipour

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…

Cellular Automata and Lattice Gases · Physics 2019-10-16 Hiroki Yamamoto , Daichi Yanagisawa , Katsuhiro Nishinari

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…

Statistical Mechanics · Physics 2025-11-04 Marina V. Yashina , Alexander G. Tatashev

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…

Probability · Mathematics 2013-02-18 Craig A. Tracy , Harold Widom

Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition algebra and the combinatorial theory of crossings and…

Combinatorics · Mathematics 2023-08-29 Zhanar Berikkyzy , Pamela E. Harris , Anna Pun , Catherine Yan , Chenchen Zhao

We investigate two closely related setups. In the first one we consider a TASEP-style system of particles with specified initial and final configurations. The probability of each history of the system is assumed to be equal. We show that…

Combinatorics · Mathematics 2023-04-13 Łukasz Maślanka , Piotr Śniady

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

We present a determinantal formula for the steady state probability of each state of the TASEP (Totally Asymmetric Simple Exclusion Process) with open boundaries, a 1D particle model that has been studied extensively and displays rich…

Combinatorics · Mathematics 2015-01-29 Olya Mandelshtam

The totally asymmetric simple exclusion process (TASEP) is a stochastic model for the unidirectional dynamics of interacting particles on a $1$D-lattice that is much used in systems biology and statistical physics. Its master equation…

Statistical Mechanics · Physics 2024-08-01 Kilian Pioch , Thomas Kriecherbauer , Michael Margaliot , Lars Grüne

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…

Combinatorics · Mathematics 2007-05-23 Andrei Asinowski , Toufik Mansour