Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice

Details Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice

1999-06-03

arxiv.org/abs/cond-mat/9906036v1

Physics

Condensed Matter

Statistical Mechanics

20 pages, 8 figures (3 of them > 1Mb)

Scientific paper

10.1088/0305-4470/32/28/304

A new algorithm for the derivation of low-density series for percolation on directed lattices is introduced and applied to the square lattice bond and site problems. Numerical evidence shows that the computational complexity grows exponentially, but with a growth factor $\lambda < \protect{\sqrt[8]{2}}$, which is much smaller than the growth factor $\lambda = \protect{\sqrt[4]{2}}$ of the previous best algorithm. For bond (site) percolation on the directed square lattice the series has been extended to order 171 (158). Analysis of the series yields sharper estimates of the critical points and exponents.

Affiliated with

Also associated with

No associations

Rating

Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice 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 Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-density series expansions for directed percolation I: A new efficient algorithm with applications to the square lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-710711