On properties of generalizations of noise sensitivity
Licentiatavhandling, 2015

In 1999, Benjamini et. al. published a paper in which they introduced two definitions, noise sensitivity and noise stability, as measures of how sensitive Boolean functions are to noise in their parameters. The parameters were assumed to be Boolean strings, and the noise consisted of each input bit changing their value with a small but positive probability. In the three papers appended to this thesis, we study generalizations of these definitions to irreducible and reversible Markov chains.

Opponent: Erik Broman


Malin Palö Forsström

Göteborgs universitet

Chalmers, Matematiska vetenskaper, matematisk statistik


Grundläggande vetenskaper


Sannolikhetsteori och statistik

Diskret matematik


Opponent: Erik Broman