Factorized steady states in mass transport models on an arbitrary graph

From MaRDI portal
Revision as of 02:54, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5466870

DOI10.1088/0305-4470/39/18/006zbMATH Open1091.82007arXivcond-mat/0602564OpenAlexW2141170571MaRDI QIDQ5466870FDOQ5466870

Martin R. Evans, Satya N. Majumdar, R. K. P. Zia

Publication date: 22 May 2006

Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Abstract: We study a general mass transport model on an arbitrary graph consisting of L nodes each carrying a continuous mass. The graph also has a set of directed links between pairs of nodes through which a stochastic portion of mass, chosen from a site-dependent distribution, is transported between the nodes at each time step. The dynamics conserves the total mass and the system eventually reaches a steady state. This general model includes as special cases various previously studied models such as the Zero-range process and the Asymmetric random average process. We derive a general condition on the stochastic mass transport rules, valid for arbitrary graph and for both parallel and random sequential dynamics, that is sufficient to guarantee that the steady state is factorisable. We demonstrate how this condition can be achieved in several examples. We show that our generalized result contains as a special case the recent results derived by Greenblatt and Lebowitz for d-dimensional hypercubic lattices with random sequential dynamics.


Full work available at URL: https://arxiv.org/abs/cond-mat/0602564






Cited In (8)






This page was built for publication: Factorized steady states in mass transport models on an arbitrary graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466870)