Skip to main content Accessibility help
×
Hostname: page-component-8448b6f56d-c47g7 Total loading time: 0 Render date: 2024-04-20T03:29:09.282Z Has data issue: false hasContentIssue false

6 - First evidence of noise sensitivity of percolation

Published online by Cambridge University Press:  18 December 2014

Christophe Garban
Affiliation:
Université Lyon I
Jeffrey E. Steif
Affiliation:
Chalmers University of Technology, Gothenberg
Get access

Summary

In this chapter, our goal is to collect some of the facts and theorems we have seen so far in order to conclude that percolation crossings are indeed noise sensitive. Recall from the “BKS” Theorem (Theorem 1.21) that it is enough for this purpose to prove that influences are “small” in the sense that ΣkIk(fn)2 goes to 0. If we want to use only what we have actually proved in this book, namely Proposition 5.6, then we need to demonstrate (5.6) in this proposition.

In the first section, we deal with a careful study of influences in the case of percolation crossings on the triangular lattice. Then, we treat the case of ℤ2, where conformal invariance is not known. Finally, we speculate to what “extent” percolation is noise sensitive.

This whole chapter should be considered somewhat of a “pause” in our program, where we take the time to summarize what we have achieved so far in our understanding of the noise sensitivity of percolation, and what remains to be done if one wishes to obtain the exact “noise sensitivity exponent” as well as the existence of exceptional times for dynamical percolation.

Bounds on influences for crossing events in critical percolation on the triangular lattice

6.1.1 Setup

Fix a, b > 0, let us consider some rectangle [0, a·n]×[0, b·n], and let Rn be the set of hexagons in T that intersect [0, a·n]×[0, b·n]. Let fn be the event that there is a left-to-right crossing event in Rn. (This is the same event as in Example 1.22 in Chapter 1, but with ℤ2 replaced by T.) By the RSW Theorem 2.1, we know that {fn} is nondegenerate. Conformal invariance tells us that E[fn] = ℙ[fn = 1] converges as n → ∞. This limit is given by the so-called Cardy's formula.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×