# The moving particle lemma for the exclusion process on a weighted graph

@article{Chen2017TheMP, title={The moving particle lemma for the exclusion process on a weighted graph}, author={Joe P. Chen}, journal={Electronic Communications in Probability}, year={2017}, volume={22} }

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… CONTINUE READING

3

Twitter Mentions

#### Citations

##### Publications citing this paper.

SHOWING 1-4 OF 4 CITATIONS

## Local ergodicity in the exclusion process on an infinite weighted graph

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

## From non-symmetric particle systems to non-linear PDEs on fractals

VIEW 1 EXCERPT

CITES METHODS

## Comparing with octopi

VIEW 1 EXCERPT

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 42 REFERENCES

## Probability on Trees and Networks

VIEW 1 EXCERPT

## COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS

VIEW 1 EXCERPT

## Large Deviations for the Boundary Driven Symmetric Simple Exclusion Process

VIEW 1 EXCERPT

HIGHLY INFLUENTIAL

## Proof of Aldous' spectral gap conjecture

VIEW 3 EXCERPTS

## Bulk diffusion in a system with site disorder

VIEW 1 EXCERPT