Quantitative noise sensitivity and exceptional times for percolation

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

64 pages; color figures; to appear in Annals of Math

Scientific paper

One goal of this paper is to prove that dynamical critical site percolation on the planar triangular lattice has exceptional times at which percolation occurs. In doing so, new quantitative noise sensitivity results for percolation are obtained. The latter is based on a novel method for controlling the "level k" Fourier coefficients via the construction of a randomized algorithm which looks at random bits, outputs the value of a particular function but looks at any fixed input bit with low probability. We also obtain upper and lower bounds on the Hausdorff dimension of the set of percolating times. We then study the problem of exceptional times for certain "k-arm" events on wedges and cones. As a corollary of this analysis, we prove, among other things, that there are no times at which there are two infinite "white" clusters, obtain an upper bound on the Hausdorff dimension of the set of times at which there are both an infinite white cluster and an infinite black cluster and prove that for dynamical critical bond percolation on the square grid there are no exceptional times at which three disjoint infinite clusters are present.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantitative noise sensitivity and exceptional times for percolation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantitative noise sensitivity and exceptional times for percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantitative noise sensitivity and exceptional times for percolation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-402672

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.