Related papers: Restricted permutations for the simple exclusion p…

In many biological systems, motile agents exhibit random motion with short-term directional persistence, together with crowding effects arising from spatial exclusion. We formulate and study a class of lattice-based models for multiple…

We consider the exclusion process on segments of the integers in a site-dependent random environment. We assume to be in the ballistic regime in which a single particle has positive linear speed. Our goal is to study the mixing time of the…

Subsequence-based time series classification algorithms provide accurate and interpretable models, but training these models is extremely computation intensive. The asymptotic time complexity of subsequence-based algorithms remains a…

We introduce a natural extension of the exclusion process to hypergraphs and prove an upper bound for its mixing time. In particular we show the existence of a constant $C$ such that for any connected, regular hypergraph $G$ within some…

The exclusion process in which particles may jump any distance l>=1 with the probability that decays as l^-(1+sigma) is studied from coarse-grained equation for density profile in the limit when the lattice spacing goes to zero. For…

We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the…

Imposing some flexible sampling scheme we provide some discretization of continuous time discrete scale invariant (DSI) processes which is a subsidiary discrete time DSI process. Then by introducing some simple random measure we provide a…

We prove a comparison inequality between a system of independent random walkers and a system of random walkers which either interact by attracting each other -- a process which we call here the symmetric inclusion process (SIP) -- or repel…

Driven by applications in telecommunication networks, we explore the simulation task of estimating rare event probabilities for tandem queues in their steady state. Existing literature has recognized that importance sampling methods can be…

An important problem arising in the study of complex networks, for instance in community detection and motif finding, is the sampling of graphs with fixed degree sequence. The equivalent problem of generating random 0,1 matrices with fixed…

An asymmetric exclusion model on an open chain with random rates for hopping particles, where overtaking is also possible, is studied numerically and by computer simulation. The phase structure of the model and the density profiles near the…

The asymmetric simple exclusion process (ASEP) is a paradigm for non-equilibrium physics that appears as a building block to model various low-dimensional transport phenomena, ranging from intracellular traffic to quantum dots. We review…

Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…

We consider the symmetric simple exclusion processes with a slow site in the discrete torus with $n$ sites. In this model, particles perform nearest-neighbor symmetric random walks with jump rates everywhere equal to one, except at one…

Derrida et al. and Sch\"{u}tz and Stinchcombe gave algebraic formulas for the correlation functions of the partially asymmetric simple exclusion process. Here we give a fairly general recipe of how to get these formulas and extend them to…

We use an n-spin system with permutation symmetric zz-interaction for simulating arbitrary pair-interaction Hamiltonians. The calculation of the required time overhead is mathematically equivalent to a separability problem of n-qubit…

We study stochastic processes that generate non-growing complex networks without self-loops and multiple edges (simple graphs). The work concentrates on understanding and formulation of constraints which keep the rewiring stochastic…

We study the persistence in a class of continuous stochastic processes that are stationary only under integer shifts of time. We show that under certain conditions, the persistence of such a continuous process reduces to the persistence of…

In a recent study [C Arita, Phys. Rev. E 80, 051119 (2009)], an extension of the M/M/1 queueing process with the excluded-volume effect as in the totally asymmetric simple exclusion process (TASEP) was introduced. In this paper, we consider…

We present an algorithm for finding the probabilities of rare events in nonequilibrium processes. The algorithm consists of evolving the system with a modified dynamics for which the required event occurs more frequently. By keeping track…