Some geometric critical exponents for percolation and the random-cluster model

Details Some geometric critical exponents for percolation and the random-cluster model Some geometric critical exponents for percolation and the random-cluster model

2009-04-22

arxiv.org/abs/0904.3448v2

Phys.Rev.E81:020102,2010

Physics

Condensed Matter

Statistical Mechanics

LaTeX2e/Revtex4. Version 2 is completely rewritten to make the exposition more reader-friendly; it consists of a 4-page main p

Scientific paper

10.1103/PhysRevE.81.020102

We introduce several infinite families of new critical exponents for the random-cluster model and present scaling arguments relating them to the k-arm exponents. We then present Monte Carlo simulations confirming these predictions. These new exponents provide a convenient way to determine k-arm exponents from Monte Carlo simulations. An understanding of these exponents also leads to a radically improved implementation of the Sweeny Monte Carlo algorithm. In addition, our Monte Carlo data allow us to conjecture an exact expression for the shortest-path fractal dimension d_min in two dimensions: d_min = (g+2)(g+18)/(32g) where g is the Coulomb-gas coupling, related to the cluster fugacity q via q = 2 + 2 cos(g\pi/2) with 2 \le g \le 4.

Affiliated with

Also associated with

No associations

Rating

Some geometric critical exponents for percolation and the random-cluster model 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 Some geometric critical exponents for percolation and the random-cluster model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some geometric critical exponents for percolation and the random-cluster model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275046