Percolation in Networks with Voids and Bottlenecks

Details Percolation in Networks with Voids and Bottlenecks Percolation in Networks with Voids and Bottlenecks

2008-11-28

arxiv.org/abs/0811.4575v2

Physics

Condensed Matter

Statistical Mechanics

to appear, Physical Review E. Small changes from first version

Scientific paper

10.1103/PhysRevE.79.021118

A general method is proposed for predicting the asymptotic percolation threshold of networks with bottlenecks, in the limit that the sub-net mesh size goes to zero. The validity of this method is tested for bond percolation on filled checkerboard and "stack-of-triangle" lattices. Thresholds for the checkerboard lattices of different mesh sizes are estimated using the gradient percolation method, while for the triangular system they are found exactly using the triangle-triangle transformation. The values of the thresholds approach the asymptotic values of 0.64222 and 0.53993 respectively as the mesh is made finer, consistent with a direct determination based upon the predicted critical corner-connection probability.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709874