Complementary algorithms for graphs and percolation

  title={Complementary algorithms for graphs and percolation},
  author={Michael J. Lee},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={76 2 Pt 2},
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 which uses the algorithms to sweep the occupation probability… CONTINUE READING


Publications referenced by this paper.
Showing 1-4 of 4 references


Y. Deng, H.W.J. Blöte
Rev. E 72, 016126 • 2005

Woudt, eds., Nearby Large Scale Structures and the Zone of Avoidance (Astronomical Society of the Pacific

P.A.A.P. Fairall
Provo, Utah, • 2005
View 2 Excerpts


M. Matsumoto, T. Nishimura, ACM Trans
Comp. Sim. 8, 3 • 1998
View 2 Excerpts

Similar Papers

Loading similar papers…