On properties of generalizations of noise sensitivity

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