A fast Monte Carlo algorithm for site or bond percolation

Details A fast Monte Carlo algorithm for site or bond percolation A fast Monte Carlo algorithm for site or bond percolation

2001-01-18

arxiv.org/abs/cond-mat/0101295v2

Phys. Rev. E 64, 016706 (2001)

Physics

Condensed Matter

Statistical Mechanics

17 pages, 13 figures. Corrections and some additional material in this version. Accompanying material can be found on the web

Scientific paper

10.1103/PhysRevE.64.016706

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.

Affiliated with

Also associated with

No associations

Rating

A fast Monte Carlo algorithm for site or bond percolation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A fast Monte Carlo algorithm for site or bond percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast Monte Carlo algorithm for site or bond percolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72327