Long term behaviour of a reversible system of interacting random walks

TL;DR

This paper studies the long-term behavior of a reversible system of interacting random walks on a finite graph, utilizing electric network methods and providing alternative proofs that do not require reversibility.

Contribution

It introduces a reversible model of interacting random walks and offers new analytical methods, including alternative proofs, for understanding their long-term dynamics.

Findings

Characterization of long-term behavior using electric network theory

Development of alternative proofs independent of reversibility

Insights into the stability and recurrence properties of the system

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.