Simple cubic random-site percolation thresholds for complex neighbourhoods

Details Simple cubic random-site percolation thresholds for complex neighbourhoods Simple cubic random-site percolation thresholds for complex neighbourhoods

2011-11-14

arxiv.org/abs/1111.3254v2

Physics

Mathematical Physics

presented at SigmaPhi2011 conference

Scientific paper

In this communication with computer simulation we evaluate simple cubic random-site percolation thresholds for neighbourhoods including the nearest neighbours (NN), the next-nearest neighbours (2NN) and the next-next-nearest neighbours (3NN). Our estimations base on finite-size scaling analysis of the percolation probability vs. site occupation probability plots. The Hoshen--Kopelman algorithm has been applied for cluster labelling. The calculated thresholds are 0.1372(1), 0.1420(1), 0.0976(1), 0.1991(1), 0.1036(1), 0.2455(1) for (NN + 2NN), (NN + 3NN), (NN + 2NN + 3NN), 2NN, (2NN + 3NN), 3NN neighbourhoods, respectively. In contrast to the results obtained for a square lattice the calculated percolation thresholds decrease monotonically with the site coordination number z, at least for our inspected neighbourhoods.

Affiliated with

Also associated with

No associations

Rating

Simple cubic random-site percolation thresholds for complex neighbourhoods 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 Simple cubic random-site percolation thresholds for complex neighbourhoods, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple cubic random-site percolation thresholds for complex neighbourhoods will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218576