Quantitative noise sensitivity and exceptional times for percolation (Q974053): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29035751 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078345182 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0504586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise sensitivity of Boolean functions and applications to percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional planes of percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Boolean models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical stability of percolation for some interacting particle systems and \(\varepsilon\)-movability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional critical percolation: the full scaling limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local properties of Lévy processes on a totally disconnected group / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the potential theory of symmetric Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Naturality, standardness, and weak duality for Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3223642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling relations for 2D-percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all words are seen in critical site percolation on the triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict inequalities for some critical exponents in two-dimensional percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4679161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-arm exponent for critical 2D percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4793292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Turn Hex and Other Selection Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of infinite clusters in dynamical percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Van den Berg–Kesten Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling limits of loop-erased random walks and uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical percolation in the plane: conformal invariance, Cardy's formula, scaling limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical exponents for two-dimensional percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of measure and isoperimetric inequalities in product spaces / rank
 
Normal rank

Latest revision as of 20:34, 2 July 2024

scientific article
Language Label Description Also known as
English
Quantitative noise sensitivity and exceptional times for percolation
scientific article

    Statements

    Quantitative noise sensitivity and exceptional times for percolation (English)
    0 references
    0 references
    0 references
    27 May 2010
    0 references
    In percolation theory, typical events of interest depend on a huge (or infinite) number of independent Bernoulli random variables. How does the outcome of such an event change if we allow a growing number of these random variables to change value each with small probability? The notion of \textit{noise sensitivity} formalizes this question and allows for quantitative answers. The authors derive noise sensitivity estimates for the event of an open left to right crossing in an (approximate) square box both for critical bond percolation on the two-dimensional integer lattice and for critical site percolation on the triangular lattice. A key step for the proofs is a bound on the Fourier coefficients of a function \(f(x)\) depending on the number of bits of \(x\) that a randomized algorithm needs in order to determine the value of \(f(x)\). While classical percolation is a static model with the bonds or sites declared open or closed according to the values of independent Bernoulli random variables (with success probability \(p\)), in the dynamical percolation model, these Bernoulli random variables undergo a time evolution. In the simplest situation, they perform the evolution of indepedent two-state Markov chains (in equilibrium) that change value to ``open'' at rate \(p\) and to ``closed'' at rate \(1-p\). It is well known that for critical site percolation on the triangular lattice, almost surely, there is no infinite open cluster. The main result of Schramm and Steif is that for dynamical critical site percolation on the triangular lattice, with probability one there are ``exceptional times'' where an infinite open cluster exists. In addition, they show that the Hausdorff dimension of the set of such times is almost surely constant and takes a value in the interval \([1/6,31/36]\). Furthermore, the authors show that there are no times where more than one infinite open cluster exists. The results depend on the so-called critical exponents of percolation that are known explicitly for site percolation on the triangular lattice. For bond percolation on the integer lattice, even existence of these exponents has not been established. For this case, the authors have analogous but less complete results.
    0 references
    0 references
    time-dependent percolation
    0 references
    randomized algorithm
    0 references
    noise sensitivity
    0 references
    Hausdorff dimension
    0 references
    Fourier coefficients
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references