Iterative Site Percolation on Triangular Lattice
arXiv:2305.14021 · doi:10.1103/PhysRevResearch.6.033318
Abstract
The site percolation on the triangular lattice stands out as one of the few exactly solved statistical systems. By initially configuring critical percolation clusters of this model and randomly reassigning the color of each percolation cluster, we obtain coarse-grained configurations by merging adjacent clusters that share the same color. It is shown that the process can be infinitely iterated in the infinite-lattice limit, leading to an iterative site percolation model. We conjecture from the self-matching argument that percolation clusters remain fractal for any finite generation, which can even take any positive real number by a generalized process. Extensive simulations are performed, and, from the generation-dependent fractal dimension, a continuous family of previously unknown universalities is revealed.
11 pages, 11 figures
References in corpus (17)
- The spread of epidemic disease on networks
- Competing spreading processes on multiplex networks: awareness and epidemics
- SLE for theoretical physicists
- Competing epidemics on complex networks
- A Guide to Stochastic Loewner Evolution and its Applications
- Epidemic spreading and risk perception in multiplex networks: a self-organized percolation method
- Exact bond percolation thresholds in two dimensions
- Climate network percolation reveals the expansion and weakening of the tropical component under global warming
- Finite-size scaling above the upper critical dimension
- Shape-dependent universality in percolation
- Critical polynomials in the nonplanar and continuum percolation models
- Percolation in Finite Matching Lattices
- History-dependent percolation on multiplex networks
- No-enclave percolation corresponds to holes in the cluster backbone
- Recursive Percolation
- Berezinskii-Kosterlitz-Thouless-like percolation transitions in the two-dimensional XY model
- History-dependent percolation in two dimensions