Electronic Communications in Probability
- Electron. Commun. Probab.
- Volume 22 (2017), paper no. 47, 13 pp.
The moving particle lemma for the exclusion process on a weighted graph
We prove a version of the moving particle lemma for the exclusion process on any finite weighted graph, based on the octopus inequality of Caputo, Liggett, and Richthammer. In light of their proof of Aldous’ spectral gap conjecture, we conjecture that our moving particle lemma is optimal in general. Our result can be applied to graphs which lack translational invariance, including, but not limited to, fractal graphs. An application of our result is the proof of local ergodicity for the exclusion process on a class of weighted graphs, the details of which are reported in a follow-up paper [arXiv:1705.10290].
Electron. Commun. Probab., Volume 22 (2017), paper no. 47, 13 pp.
Received: 3 June 2016
Accepted: 29 August 2017
First available in Project Euclid: 2 October 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 05C81: Random walks on graphs 28A80: Fractals [See also 37Fxx] 31C20: Discrete potential theory and numerical methods 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43] 82C22: Interacting particle systems [See also 60K35]
Chen, Joe P. The moving particle lemma for the exclusion process on a weighted graph. Electron. Commun. Probab. 22 (2017), paper no. 47, 13 pp. doi:10.1214/17-ECP82. https://projecteuclid.org/euclid.ecp/1506931447