Electronic Journal of Probability

Monotonicity properties of exclusion sensitivity

Malin Palö Forsström

Full-text: Open access


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.

Article information

Electron. J. Probab., Volume 21 (2016), paper no. 45, 22 pp.

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

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60J27: Continuous-time Markov processes on discrete state spaces 05C81: Random walks on graphs

exclusion sensitivity noise sensitivity exclusion process

Creative Commons Attribution 4.0 International License.


Palö Forsström, Malin. Monotonicity properties of exclusion sensitivity. Electron. J. Probab. 21 (2016), paper no. 45, 22 pp. doi:10.1214/16-EJP4092. https://projecteuclid.org/euclid.ejp/1469557138

Export citation


  • [1] Ahlberg, D. and Broman, E. and Griffiths, S. and Morris, R.: Noise sensitivity in continuum percolation. Israel J. Math. 201, (2014), no. 2, 847–899.
  • [2] Benjamini, I. and Kalai, G. and Schramm, O.: Noise sensitivity of Boolean functions and applications to percolation. Inst. Hautes Études Sci. Publ. Math. 90, (1999), 5–43.
  • [3] Broman, E. and Garban, C. and Steif, J.: Exclusion sensitivity of Boolean functions. Probab. Theory Related Fields 155, (2013), 621–663.
  • [4] Brouwer, A. and Haemers, W.: Spectra of graphs. Springer, New York, 2012. xiv+250 pp.
  • [5] Caputo, P. and Liggett, T. and Richthammer, T.: Proof of Aldous’ spectral gap conjecture. J. Amer. Math. Soc. 23, (2010), no. 3, 831–851.
  • [6] Chung, F.: Spectral graph theory. American Mathematical Society, 1997. xii+207 pp.
  • [7] Filmus, Y.: Orthogonal basis for functions over a slice of the Boolean hypercube. Electron. J. Combin. 23, (2016), no. 1.
  • [8] Garban, C. and Steif, J.: Noise sensitivity of Boolean functions and percolation. Cambridge University Press, New York, 2014.
  • [9] Kindler, G. and O’Donnell, R.: Gaussian noise sensitivity and Fourier tails. 2012 IEEE 27th Conference on Computational Complexity, 2012.
  • [10] Mossel, E. and O’Donnel, R.: Coin flipping from a cosmic source: On error correction of truly random bits. Random Structures Algorithms 26, (2005), no. 4, 418–436.
  • [11] Schramm, O. and Tsirelson, B.: Trees, not cubes: Hypercontractivity, cosiness and noise stability. Electron. Comm. Probab. 4, (1999), 39–49.