Related papers: Blocks in the Asymmetric Simple Exclusion Process
We study a new process, which we call ASEP$(q,j)$, where particles move asymmetrically on a one-dimensional integer lattice with a bias determined by $q\in (0,1)$ and where at most $2j\in\mathbb{N}$ particles per site are allowed. The…
We consider the symmetric simple exclusion system on $\mathbb{Z}^d$, $d \ge 2$, starting from a class of ``step'' initial conditions in which particles are constrained within a half-space. One may count the number $N_t$ of particles that…
We give bounds on the rate of convergence to equilibrium of the symmetric simple exclusion process in $\Z^d$. Our results include the existent results in the literature. We get better bounds and larger class of initial states via a unified…
To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…
We consider an Asymmetric Exclusion Process evolving on parallel mutually interacting lanes with neighbouring nearest hoppings of hardcore particles. Number of particles on each lane is conserved. We find a choice of the hopping rates, for…
We introduce a self-reinforced point processes on the unit interval that appears to exhibit self-organized criticality, somewhat reminiscent of the well-known Bak-Sneppen model. The process takes values in the finite subsets of the unit…
The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
This note proves an upper bound for the fluctuations of a second-class particle in the totally asymmetric simple exclusion process. The proof needs a lower tail estimate for the last-passage growth model associated with the exclusion…
We study a $d$-dimensional random walk with exponentially distributed increments conditioned so that the components stay ordered (in the sense of Doob). We find explicitly a positive harmonic function $h$ for the killed process and then…
We study the one-dimensional discrete time totally asymmetric simple exclusion process with parallel update rules on a spatially periodic domain. A multi-point space-time joint distribution formula is obtained for general initial…
We consider a driven tagged particle in a symmetric exclusion process on Z with a removal rule. In this process, untagged particles are removed once they jump to the left of the tagged particle. We investigate the behavior of the…
We consider the behavior of extremal particles in $K$-symmetric exclusion on $\mathbb{Z}$ when the process starts from certain infinite-particle step configurations where there are no particles to the right of a maximal one. In such a…
We consider a run-and-tumble particle on a half-line with an absorbing target at the origin. The particle has an internal velocity state that switches between two opposite values at Poisson-distributed times. The position of the particle…
We present a new description of the known large deviation function of the classical symmetric simple exclusion process by exploiting its connection with the quantum symmetric simple exclusion processes and using tools from free probability.…
We investigate the dynamics of a one-dimensional asymmetric exclusion process with Langmuir kinetics and a fluctuating wall. At the left boundary, particles are injected onto the lattice; from there, the particles hop to the right. Along…
An explicit Fredholm determinant formula is derived for the multipoint distribution of the height function of the totally asymmetric simple exclusion process (TASEP) with arbitrary right-finite initial condition. The method is by solving…
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…
We study a system composed of two parallel totally asymmetric simple exclusion processes with open boundaries, where the particles move in the two lanes in opposite directions and are allowed to jump to the other lane with rates inversely…
Our article deals with Bayesian inference for a general state space model with the simulated likelihood computed by the particle filter. We show empirically that the partially or fully adapted particle filters can be much more efficient…
The analysis of stochastic loss networks has long been of interest in computer and communications networks and is becoming important in the areas of service and information systems. In traditional settings, computing the well known Erlang…