Long term behaviour of a reversible system of interacting random walks
classification
🧮 math.PR
keywords
behaviourinteractingrandomreversiblesystemwalksadditionallows
read the original abstract
This paper concerns the long-term behaviour of a system of interacting random walks labeled by vertices of a finite graph. The model is reversible which allows to use the method of electric networks in the study. In addition, examples of alternative proofs not requiring reversibility are provided.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.