Efficient Monte Carlo algorithm and high-precision results for percolation
M. E. J. Newman, R. M. Ziff
Abstract
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond occupation probabilities from zero to one in a single run which takes an amount of time scaling linearly with the number of sites on the lattice. We use our algorithm to determine that the percolation transition occurs at occupation probability 0.59274621(13) for site percolation on the square lattice and to provide clear numerical confirmation of the conjectured 4/3-power stretched-exponential tails in the spanning probability functions.
Create a lesson
Related papers
Dynamically Reentrant Skyrmion Phase in Oscillating Magnetic Fields
Z. Demir Vatansever, E. Vatansever, A. Vasilopoulos et al.
Mutual linearity in semi-Markov networks
Julian B. Voits, Ulrich S. Schwarz
Steady states in asymmetric exclusion processes with reactions: Fluctuations and non-mean field behaviour
Rohn Chatterjee, Atri Goswami, Sudip Mukherjee
Marginal Operator Deformations and Pseudocriticality in Baxter--Wu Models
Hyun-Yong Lee, Naoki Kawashima, Nikolaos G. Fytas et al.
Kardar--Parisi--Zhang density hydrodynamics in a coherent XXZ--ASEP Lindbladian
Yansheng Liu, Daoguang Li, Kaixiang Lu et al.
Brownian gyrator model with stochastic resetting
Satya N. Majumdar, Gregory Schehr, Pascal Viot et al.