Related papers: Restricted permutations for the simple exclusion p…
Stochastic exclusion processes play an integral role in the physics of non-equilibrium statistical mechanics. These models are Markovian processes, described by a classical master equation. In this paper a quantum mechanical version of a…
We study the dynamics of an asymmetric simple exclusion process with open boundaries and local interactions using a pair approximation which generalizes the 2-node cluster mean field theory and the Markov chain approach to kinetics and…
We study the dynamical large deviations of the classical stochastic symmetric simple exclusion process (SSEP) by means of numerical matrix product states. We show that for half-filling, long-time trajectories with a large enough imbalance…
We show that in the asymmetric simple exclusion process (ASEP) on a ring, conditioned on carrying a large flux, the particle experience an effective long-range potential which in the limit of very large flux takes the simple form $U=…
Stochastic driven flow along a channel can be modeled by the asymmetric simple exclusion process. We confirm numerically the presence of a dynamic queuing phase transition at a nonzero obstruction strength, and establish its scaling…
We prove Gaussian tail estimates for the transition probability of $n$ particles evolving as symmetric exclusion processes on $\bb Z^d$, improving results obtained in \cite{l}. We derive from this result a non-equilibrium Boltzmann-Gibbs…
Uniform sampling of simple graphs having a given degree sequence is a known problem with exponential complexity in the square of the mean degree. For undirected graphs, randomised approximation algorithms have nonetheless been shown to…
In social settings, individuals interact through webs of relationships. Each individual is a node in a complex network (or graph) of interdependencies and generates data, lots of data. We label the data by its source, or formally stated, we…
The totally asymmetric simple exclusion process with generalized update is a version of the discrete time totally asymmetric exclusion process with an additional inter-particle interaction that controls the degree of particle clustering.…
We consider the problem of clustering grouped data with possibly non-exchangeable groups whose dependencies can be characterized by a known directed acyclic graph. To allow the sharing of clusters among the non-exchangeable groups, we…
We study the generic non-equilibrium steady states in asymmetric exclusion processes on a closed network with bottlenecks. To this end we proposes and study closed simple networks with multiply-connected non-identical junctions. Depending…
In this article, we investigate a multispecies generalization of the single-species asymmetric simple exclusion process defined on an open one-dimensional lattice. We devise an exact projection scheme to find the phase diagram in terms of…
In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either $\mathbb{Z}^d$, a $d$-dimensional torus…
This article studies the solutions of time-dependent differential inclusions which is motivated by their utility in the modeling of certain physical systems. The differential inclusion is described by a time-dependent set-valued mapping…
Totally asymmetric simple exclusion processes on lattices with junctions, where particles interact with hard-core exclusion and move on parallel lattice branches that at the junction combine into a single lattice segment, are investigated.…
We study coarsening phenomena in three different simple exclusion processes with quenched disordered jump rates. In the case of the totally asymmetric process, an earlier phenomenological description is improved, yielding for the time…
This paper deals with the balanced truncation model reduction of discrete-time, linear time-varying, heterogeneous subsystems interconnected over finite arbitrary directed graphs. The information transfer between the subsystems is subject…
We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…
We consider random walks on marked simple point processes with symmetric jump rates and unbounded jump range. We prove homogenization properties of the associated Markov generators. As an application, we derive the hydrodynamic limit of the…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…