Related papers: Mapping TASEP back in time
A class of exclusion processes in which particles perform history-dependent random walks is introduced, stimulated by dynamic phenomena in some biological and artificial systems. The particles locally interact with the underlying substrate…
We present a backward diffusion flow (i.e. a backward-in-time stochastic differential equation) whose marginal distribution at any (earlier) time is equal to the smoothing distribution when the terminal state (at a latter time) is…
We consider a stochastic individual-based population model with competition, trait-structure affecting reproduction and survival, and changing environment. The changes of traits are described by jump processes, and the dynamics can be…
We consider the totally asymmetric simple exclusion process on a ring with flat and step initial conditions. We assume that the size of the ring and the number of particles tend to infinity proportionally and evaluate the fluctuations of…
We investigate the recently introduced inhomogeneous $n$-species $t$-PushTASEP, a long-range stochastic process on a periodic lattice. A Baxter-type formula is established, expressing the Markov matrix as an alternating sum of commuting…
We extend the paradigmatic and versatile TASEP (Totally Asymmetric Simple Exclusion Process) for stochastic 1d transport to allow for two different particle species, each having specific entry and exit rates. We offer a complete mean-field…
Markov jump processes are continuous-time stochastic processes with a wide range of applications in both natural and social sciences. Despite their widespread use, inference in these models is highly non-trivial and typically proceeds via…
We study the existence of densities for distributions of piecewise deterministic Markov processes. We also obtain relationships between invariant densities of the continuous time process and that of the process observed at jump times. In…
Markov-chain Monte Carlo (MCMC), the field of stochastic algorithms built on the concept of sampling, has countless applications in science and technology. The overwhelming majority of MCMC algorithms are time-reversible and satisfy the…
It is known that when the steady state of a one-dimensional multispecies system, which evolves via a random-sequential updating mechanism, is written in terms of a linear combination of Bernoulli shock measures with random-walk dynamics, it…
In this paper, we consider the gradual-impulse control problem of continuous-time Markov decision processes, where the system performance is measured by the expectation of the exponential utility of the total cost. We prove, under very…
We consider the discrete-time migration-recombination equation, a deterministic, nonlinear dynamical system that describes the evolution of the genetic type distribution of a population evolving under migration and recombination in a law of…
We consider the TASEP on Z with two blocks of particles having different jump rates. We study the large time behavior of particles' positions. It depends both on the jump rates and the region we focus on, and we determine the complete…
The evolution of a continuous time Markov process with a finite number of states is usually calculated by the Master equation - a linear differential equations with a singular generator matrix. We derive a general method for reducing the…
The oriented swap process is a natural directed random walk on the symmetric group that can be interpreted as a multi-species version of the Totally Asymmetric Simple Exclusion Process (TASEP) on a finite interval. An open problem from a…
We consider the q-TASEP that is a q-deformation of the totally asymmetric simple exclusion process (TASEP) on Z for q in [0,1) where the jump rates depend on the gap to the next particle. For step initial condition, we prove that the…
We study the totally asymmetric simple exclusion process with open boundaries in the high density and the low density phase. In the bulk of the two phases, we show that the process on a segment of length $N$ exhibits cutoff at order $N$,…
Consider the following Markov chain on permutations of length $n$. At each time step we choose a random position. If the letter at that position is smaller than the letter immediately to the left (cyclically) then these letters swap…
We revisit a totally asymmetric simple exclusion process (TASEP) with open boundaries and a global constraint on the total number of particles [Adams, et. al. 2008 J. Stat. Mech. P06009]. In this model, the entry rate of particles into the…
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…