Abstract
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and find compelling numerical evidence 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 previously known universality classes, and cannot be accommodated by existing analytical methods. We confirm that recursive percolation is well defined also in three dimensions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
