Restricted permutations for the simple exclusion process in discrete time over graphs

Abstract

Exclusion processes became paradigmatic models of nonequilibrium interacting particle systems of wide range applicability both across the natural and the applied, social and technological sciences. Usually they are defined as a continuous-time stochastic process, but in many situations it would be desirable to have a discrete-time version of them. There is no generally applicable formalism for exclusion processes in discrete-time. In this paper we define the symmetric simple exclusion process in discrete time over graphs by means of restricted permutations over the labels of the vertices of the graphs and describe a straightforward sequential importance sampling algorithm to simulate the process. We investigate the approach to stationarity of the process over loop-augmented Bollobás-Chung "cycle-with-matches" graphs. In all cases the approach is algebraic with an exponent varying between $1$ and $2$ depending on the number of matches.

arXiv commentA somewhat provisional manuscript, 10 pages, 3 figures. Constructive comments are welcome

References in corpus (9)

• Discrete stochastic models for traffic flow
• The totally asymmetric exclusion process with extended objects, a model for protein synthesis
• Exact Large Deviation Function in the Asymmetric Exclusion Process
• Exact Current Statistics of the ASEP with Open Boundaries
• The totally asymmetric simple exclusion process on networks
• Asymmetric exclusion processes with shuffled dynamics
• Irreversible local Markov chains with rapid convergence towards equilibrium
• Queueing process with excluded-volume effect
• On the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions