Monotonicity result for the simple exclusion process on finite connected graphs

Shiba Biswal, Nicolas Lanchier

Research output: Contribution to journalArticlepeer-review


The simple exclusion process studied in this paper consists of a system of K particles moving on the vertex set of a finite undirected connected graph. If there is one, the particle at x chooses one of the deg(x) neighbors of its current location uniformly at random at rate ρx > 0, and jumps to that vertex if and only if it is empty. Though this model is a natural mathematical object, it is also motivated by applications in the control of robotic swarms. After expressing the stationary distribution and the limiting occupation times of the process, we study how the total number of particles affects the occupation times ratios at different vertices.

Original languageEnglish (US)
Pages (from-to)21-32
Number of pages12
Issue number1
StatePublished - 2023
Externally publishedYes


  • Interacting particle systems
  • occupation time
  • robotics
  • simple exclusion process

ASJC Scopus subject areas

  • Statistics and Probability


Dive into the research topics of 'Monotonicity result for the simple exclusion process on finite connected graphs'. Together they form a unique fingerprint.

Cite this