Noise sensitivity of percolation via differential inequalities

نویسندگان

چکیده

Consider critical Bernoulli percolation in the plane. We give a new proof of sharp noise sensitivity theorem shown by Garban, Pete, and Schramm (Acta Math. 205 (2010), 19–104). Contrary to previous approaches, we do not use any spectral tool. rather study differential inequalities satisfied dynamical four-arm event, spirit Kesten's scaling relations Kesten (Comm. Phys. 109 (1987), 109–156). also obtain results percolation. In particular, prove that Hausdorff dimension set times with both primal dual equals 2 / 3 $2/3$ almost surely.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noise sensitivity of Boolean functions and percolation

The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....

متن کامل

Lectures on noise sensitivity and percolation

The goal of this set of lectures is to combine two seemingly unrelated topics: • The study of Boolean functions, a field particularly active in computer science • Some models in statistical physics, mostly percolation The link between these two fields can be loosely explained as follows: a percolation configuration is built out of a collection of i.i.d " bits " which determines whether the corr...

متن کامل

Noise sensitivity of Boolean functions and percolation , by Christophe Garban

The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....

متن کامل

Noise sensitivity of Boolean functions and percolation , by Christophe

The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....

متن کامل

Noise Sensitivity of Boolean Functions And Applications to Percolation

It is shown that a large class of events in a product probability space are highly sensitive to noise, in the sense that with high probability, the configuration with an arbitrary small percent of random errors gives almost no prediction whether the event occurs. On the other hand, weighted majority functions are shown to be noise-stable. Several necessary and sufficient conditions for noise se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of The London Mathematical Society

سال: 2023

ISSN: ['1460-244X', '0024-6115', '1234-5678']

DOI: https://doi.org/10.1112/plms.12507