Related papers: Restricted permutations for the simple exclusion p…
We present a study of exclusion processes on networks as models for complex transport phenomena and in particular for active transport of motor proteins along the cytoskeleton. We argue that active transport processes on networks…
Totally asymmetric simple exclusion processes, consisting of two coupled parallel lattice chains with particles interacting with hard-core exclusion and moving along the channels and between them, are considered. In the limit of strong…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
We define a new variant of exclusion processes in discrete time that has jump probabilities that depend on the last jump performed. In a particular limit for the jump probabilities and in suitable scaling limits for space and time, we…
We consider the symmetric inclusion process on a general finite graph. Our main result establishes universal upper and lower bounds for the spectral gap of this interacting particle system in terms of the spectral gap of the random walk on…
We study the mixing time of the symmetric beta-binomial splitting process on finite weighted connected graphs $G=(V,E,\{r_e\}_{e\in E})$ with vertex set $V$, edge set $E$ and positive edge-weights $r_e>0$ for $e\in E$. This is an…
We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…
We introduce a model for stochastic transport on a one-dimensional substrate with particles assuming different conformations during their stepping cycles. These conformations correspond to different footprints on the substrate: in order to…
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…
We study the large space and time scale behavior of a totally asymmetric, nearest-neighbor exclusion process in one dimension with random jump rates attached to the particles. When slow particles are sufficiently rare the system has a phase…
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…
Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the…
Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The…
We consider a one-dimensional continuous time random walk with transition rates depending on an underlying autonomous simple symmetric exclusion process starting out of equilibrium. This model represents an example of a random walk in a…
We investigate a non-Poissonian version of the asymmetric simple exclusion process, motivated by the observation that coarse-graining the interactions between particles in complex systems generically leads to a stochastic process with a…
The Symmetric Exclusion Process (SEP), in which particles hop symmetrically on a discrete line with hard-core constraints, is a paradigmatic model of subdiffusion in confined systems. This anomalous behavior is a direct consequence of…
We present a numerical study of a two-lane version of the stochastic non-equilibrium model known as the totally asymmetric simple exclusion process. For such a system with open boundaries, and suitably chosen values of externally-imposed…
Using the matrix product formalism we formulate a natural p-species generalization of the asymmetric simple exclusion process. In this model particles hop with their own specific rate and fast particles can overtake slow ones with a rate…
We present a study of exclusion process on a peculiar topology of network with two intersected lanes, competing for the particles in a reservoir with finite capacity. To provide a theoretical ground for our findings, we exploit mean-field…
The totally asymmetric simple exclusion process in discrete time is considered on finite rings with fixed number of particles. A translation-invariant version of the backward-ordered sequential update is defined for periodic boundary…