Recursive Percolation

Abstract

We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation thresholds up to $n=5$. The corresponding critical clusters become more and more compact as $n$ increases, and define universal scaling functions of the standard two-dimensional form and critical exponents that are distinct for any $n$. This family of exponents differs from any previously known universality class, and cannot be accommodated by existing analytical methods. We confirm that recursive percolation is well defined also in three dimensions.

8 pages, 8 figures

References in corpus (10)

• A Guide to Stochastic Loewner Evolution and its Applications
• On the critical behavior of the Susceptible-Infected-Recovered (SIR) model on a square lattice
• Logarithmic observables in critical percolation
• Multifractality of self-avoiding walks on percolation clusters
• Geometric structure of percolation clusters
• Short-range correlations in percolation at criticality
• Fragmentation of fractal random structures
• Asymptotic scaling behavior of self-avoiding walks on critical percolation clusters
• Loop erased random walk on percolation cluster: Crossover from Euclidean to fractal geometry
• Loop erased random walk on a percolation cluster is compatible with Schramm-Loewner evolution

Cited by in corpus (6)

• Critical fragmentation properties of random drilling: How many random holes need to be drilled to collapse a wooden cube?
• History-dependent percolation on multiplex networks
• History-dependent percolation in two dimensions
• Coupling of $c=-2$ and $c=\frac{1}{2}$ and $c=0$ conformal field theories: The geometrical point of view
• Bridges in the random-cluster model
• Iterative Site Percolation on Triangular Lattice