Open Access
Translator Disclaimer
2016 Monotonicity properties of exclusion sensitivity
Malin Palö Forsström
Electron. J. Probab. 21: 1-22 (2016). DOI: 10.1214/16-EJP4092


In [3], 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 [3]. In addition, we get results about the eigenvectors and eigenvalues of symmetric exclusion processes on complete graphs.


Download Citation

Malin Palö Forsström. "Monotonicity properties of exclusion sensitivity." Electron. J. Probab. 21 1 - 22, 2016.


Received: 5 February 2015; Accepted: 11 July 2016; Published: 2016
First available in Project Euclid: 26 July 2016

zbMATH: 1345.60114
MathSciNet: MR3530322
Digital Object Identifier: 10.1214/16-EJP4092

Primary: 05C81 , 60J27

Keywords: Exclusion process , exclusion sensitivity , Noise sensitivity


Vol.21 • 2016
Back to Top