## Correlation inequalities and the symmetric exclusion processes over general graphs
In a (Z/nZ)
or nice subgraphs of them, not much is known about
it over general graphs.
In this talk we develop some tools that relate the exclusion process
over ^{d}G to a regular continuous-time random walk over G. In particular,
we prove a correlation inequality for hitting "moving tagets": if k
particles move according to the exclusion rule, they are at least as
likely to hit an independently evolving set by time t as k independent
walkers. We then use these results to obtain general bounds on the
mixing time of symmetric exclusion in terms of the spectral gap of G.
[Work in progress.]
| |