Related papers: Restricted permutations for the simple exclusion p…
The transfer matrix and matrix multiplication ansatz, when applied to nonequilibrium steady states in asymmetric exclusion processed and traffic models, has given many exact results for phase diagrams, bulk densities and fluxes, as well as…
Multi-particle dynamics in one-dimensional asymmetric exclusion processes with disorder is investigated theoretically by computational and analytical methods. It is argued that the general phase diagram consists of three non-equilibrium…
We prove a general theorem on cutoffs for symmetric exclusion and interchange processes on finite graphs $G_N=(V_N,E_N)$, under the assumption that either the graphs converge geometrically and spectrally to a compact metric measure space,…
A non-equilibrium particle transport model, the totally asymmetric exclusion process, is studied on a one-dimensional lattice with a hierarchy of fixed long-range connections. This model breaks the particle-hole symmetry observed on an…
Sampling algorithms, hypergraph degree sequences, and polytopes play a crucial role in statistical analysis of network data. This article offers a brief overview of open problems in this area of discrete mathematics from the point of view…
The spectrum of Hamiltonian (Markov matrix) of a multi-species asymmetric simple exclusion process on a ring is studied. The dynamical exponent concerning the relaxation time is found to coincide with the one-species case. It implies that…
We introduce the headway exclusion process which is an exclusion process with $N$ particles on the one-dimensional discrete torus with $L$ sites with jump rates that depend only on the distance to the next particle in the direction of the…
Motivated by kinetically constrained interacting particle systems (KCM), we consider a reversible coalescing and branching simple exclusion process on a general finite graph $G=(V,E)$ dual to the biased voter model on $G$. Our main goal are…
We prove an upper bound for the $\varepsilon$-mixing time of the symmetric exclusion process on any graph G, with any feasible number of particles. Our estimate is proportional to $\mathsf{T}_{\mathsf{RW}(G)}\ln(|V|/\varepsilon)$, where |V|…
We study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on $\mathbb{R}^d$. This class includes the age-dependent random connection model and the soft Boolean…
We consider the asymmetric simple exclusion process with Langmuir kinetics on a periodic lattice. We analytically obtain the exact time evolution of correlation functions with arbitrary length starting from the initial state with no…
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet…
This study in centered on models accounting for stochastic deformations of sample paths of random walks, embedded either in $\mathbb{Z}^2$ or in $\mathbb{Z}^3$. These models are immersed in multi-type particle systems with exclusion.…
Temporal point processes offer a powerful framework for sampling from discrete distributions, yet they remain underutilized in existing literature. We show how to construct, for any target multivariate count distribution with…
As a solvable and broadly applicable model system, the totally asymmetric exclusion process enjoys iconic status in the theory of non-equilibrium phase transitions. Here, we focus on the time dependence of the total number of particles on a…
We introduce an algorithm based on a method of snapshots for computing approximate balanced truncations for discrete-time, stable, linear time-periodic systems. By construction, this algorithm is applicable to very high-dimensional systems,…
We have shown that the partition function of the Asymmetric Simple Exclusion Process with open boundaries in a sublattice-parallel updating scheme is equal to that of a two-dimensional one-transit walk model defined on a diagonally rotated…
A two-parameter family of discrete-time exactly-solvable exclusion processes on a one-dimensional lattice is introduced, which contains the asymmetric simple exclusion process and the drop-push model as particular cases. The process is…
A model of a discrete pregeometry on a microscopic scale is introduced. This model is a finite network of finite elementary processes. The mathematical description is a d-graph that is a generalization of a graph. This is the particular…
We study the long time asymptotics of the relaxation dynamics of the totally asymmetric simple exclusion process on a ring. Evaluating the asymptotic amplitudes of the local currents by the algebraic Bethe ansatz method, we find the…