Pair Connectedness and Shortest Path Scaling in Critical Percolation

Details Pair Connectedness and Shortest Path Scaling in Critical Percolation Pair Connectedness and Shortest Path Scaling in Critical Percolation

1999-06-20

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

Physics

Condensed Matter

Statistical Mechanics

7 pages, including 4 postscript figures

Scientific paper

10.1088/0305-4470/32/35/301

We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For $d=2$ they clearly disprove a recent conjecture by M. Porto et al., Phys. Rev. {\bf E 58}, R5205 (1998). Our data also provide upper bounds on the probability that two near-by points are on different infinite clusters.

Affiliated with

Also associated with

No associations

Rating

Pair Connectedness and Shortest Path Scaling in Critical 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 Pair Connectedness and Shortest Path Scaling in Critical Percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pair Connectedness and Shortest Path Scaling in Critical Percolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-395168