A fast Monte Carlo algorithm for site or bond percolation release_xnmxoby7vbcdrhyenved6nqyx4

by M. E. J. Newman, R. M. Ziff

Released as a article .

2001  

Abstract

We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time which scales linearly with the size of the system. We demonstrate our algorithm by using it to investigate a number of issues in percolation theory, including the position of the percolation transition for site percolation on the square lattice, the stretched exponential behavior of spanning probabilities away from the critical point, and the size of the giant component for site percolation on random graphs.
In text/plain format

Archived Files and Locations

application/pdf  408.5 kB
file_dqgj4j2jkndv5biuivzbjrqbai
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2001-01-18
Version   v1
Language   en ?
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: d8c7e064-4226-4b74-bda9-0e5d119b2881
API URL: JSON