Long Term Behaviour of a Reversible System of Interacting Random Walks

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift


This paper studies the long-term behaviour of a system of interacting random walks labelled by vertices of a finite graph. We show that the system undergoes phase transitions, with different behaviour in various regions, depending on model parameters and properties of the underlying graph. We provide the complete classification of the long-term behaviour of the corresponding continuous time Markov chain, identifying whether it is null recurrent, positive recurrent, or transient. The proofs are partially based on the reversibility of the model, which allows us to use the method of electric networks. We also provide some alternative proofs (based on the Lyapunov function method and the renewal theory), which are of interest in their own right, since they do not require reversibility and can be applied to more general situations.


Enheter & grupper
Externa organisationer
  • Uppsala universitet
  • Royal Holloway University of London

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Transportteknik och logistik


Sidor (från-till)71-96
TidskriftJournal of Statistical Physics
Utgåva nummer1
Tidigt onlinedatum2019
StatusPublished - 2019
Peer review utfördJa