In , exclusion sensitivity and exclusion stability for symmetric exclusion processes on graphs were defined as natural analogues of noise sensitivity and noise stability in this setting. As these concepts were defined for any sequence of connected graphs, it is natural to study the monotonicity properties of these definitions, and in particular, if some graphs are in some sense more stable or sensitive than others. The main purpose of this paper is to answer one such question which was stated explicitly in . In addition, we get results about the eigenvectors and eigenvalues of symmetric exclusion processes on complete graphs.
"Monotonicity properties of exclusion sensitivity." Electron. J. Probab. 21 1 - 22, 2016. https://doi.org/10.1214/16-EJP4092