Probability of Incipient Spanning Clusters in Critical Square Bond Percolation

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, 1 table, 5 figures (1PS+4*Latex),uses epsf.sty Int.J.Mod.Phys. C (submitted to)

Scientific paper

10.1142/S0129183197000394

The probability of simultaneous occurence of at least k spanning clusters has been studied by Monte Carlo simulations on the 2D square lattice at the bond percolation threshold $p_c=1/2$. It is found that the probability of k and more Incipient Spanning Clusters (ISC) has the values $P(k>1) \approx 0.00658(3)$ and $P(k>2) \approx 0.00000148(21)$ provided that the limit of these probabilities for infinite lattices exists. The probability $P(k>3)$ of more than three ISC could be estimated to be of the order of 10^{-11} and is beyond the possibility to compute a such value by nowdays computers. So, it is impossible to check in simulations the Aizenman law for the probabilities when $k>>1$. We have detected a single sample with 4 ISC in a total number of about 10^{10} samples investigated. The probability of single event is 1/10 for that number of samples.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Probability of Incipient Spanning Clusters in Critical Square Bond 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 Probability of Incipient Spanning Clusters in Critical Square Bond Percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probability of Incipient Spanning Clusters in Critical Square Bond Percolation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-102562

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.