New methods to bound the critical probability in fractal percolation

We study the critical probability p_c(M) in two‐dimensional M‐adic fractal percolation. To find lower bounds, we compare fractal percolation with site percolation. Fundamentally new is the construction of a computable increasing sequence that converges to p_c(M). We prove that and . For the upper bounds, we introduce an iterative random process on a finite alphabet , which is easier to analyze than the original process. We show that and . © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 710–730, 2015