2015/01/08 by Malin Palö Forsström, Forsström, Malin Palö · 1 citation
Computer Science · Mathematics · #60J27 #Advanced Graph Theory Research #Artificial intelligence #Computer science #Discrete mathematics #Extension (predicate logic) #FOS: Mathematics #Focus (optics) #Graph #Markov Chains and Monte Carlo Methods #Markov chain #Mathematics #Noise (video) #Physics #Probability (math.PR) #Pure mathematics #Random walk #Sensitivity (control systems) #Statistics #Stochastic processes and statistical mechanics #math.PR #msc:60J27
paper · pdf · doi:10.48550/arxiv.1501.01828
published in arXiv (Cornell University) (Cornell University) · 18 pages
openalex publication_date 2015/01/08 · arxiv created 2015/06/25 · arxiv updated 2015/06/26 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
During the past 15 years, several extensions of the concept of noise sensitivity first coined in~\citeschramm2000, has been studied. One such extension was studied in ??, where the definition of noise sensitivity was extended to noise corresponding to any sequence of irreducible and reversible Markov chains. In this paper we focus on the case where the Markov chain is a random walk on a Schreier graph, and show that the Benjamini-Kalai-Schramm theorem, connecting influences to noise sensitivity, holds in this setting. We then apply this result to give an alternative proof of one of the main results from a recent paper on exclusion sensitivity by Broman, Garban and Steif.