Complementary algorithms for graphs and percolation

Details Complementary algorithms for graphs and percolation Complementary algorithms for graphs and percolation

2007-08-04

arxiv.org/abs/0708.0600v1

Computer Science

Data Structures and Algorithms

5 pages, 3 figures, poster version presented at statphys23 (2007)

Scientific paper

10.1103/PhysRevE.76.027702

A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph representation and so, in concert, can arbitrarily modify any graph. Since the clusters of a percolation model may be described as simple connected graphs, an efficient Monte Carlo scheme can be constructed that uses the algorithms to sweep the occupation probability back and forth between two turning points. This approach concentrates computational sampling time within a region of interest. A high precision value of pc = 0.59274603(9) was thus obtained, by Mersenne twister, for the two dimensional square site percolation threshold.

Affiliated with

Also associated with

No associations

Rating

Complementary algorithms for graphs and 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 Complementary algorithms for graphs and percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complementary algorithms for graphs and percolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499864