Percolation thresholds for discrete-continuous models with nonuniform probabilities of bond formation.

@article{Szczygiel2015PercolationTF,
  title={Percolation thresholds for discrete-continuous models with nonuniform probabilities of bond formation.},
  author={Bartlomiej Szczygiel and Marek Dudynski and Kamil Kwiatkowski and Maciej Lewenstein and G John Lapeyre and Jan Wehr},
  journal={Physical review. E},
  year={2015},
  volume={93 2},
  pages={
          022127
        }
}
We introduce a class of discrete-continuous percolation models and an efficient Monte Carlo algorithm for computing their properties. The class is general enough to include well-known discrete and continuous models as special cases. We focus on a particular example of such a model, a nanotube model of disintegration of activated carbon. We calculate its exact critical threshold in two dimensions and obtain a Monte Carlo estimate in three dimensions. Furthermore, we use this example to analyze… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 49 REFERENCES

Fast Monte Carlo algorithm for site or bond percolation.

  • M. NewmanR. Ziff
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
An efficient algorithm is described that can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time that scales linearly with the size of the system.

Percolation and cluster distribution. III. Algorithms for the site-bond problem

Algorithms for estimating the percolation probabilities and cluster size distribution are given in the framework of a Monte Carlo simulation for disordered lattices for the generalized site-bond

Non-Gaussian Limiting Behavior of the Percolation Threshold in a Large System

Abstract: We study short-range percolation models. In a finite box we define the percolation threshold as a random variable obtained from a stochastic procedure used in actual numerical calculations,

Continuum Percolation with Unreliable and Spread-Out Connections

It is indicated that real networks can exploit the presence of spread-out and unreliable connections to achieve connectivity more easily, provided they can maintain the average number of functioning connections per node.

Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks.

It is shown how a simple scaling operation can change the percolation properties of the model, leading to the almost sure existence of an unbounded connected component for large values of lambda, for any covering algorithm.

Percolation and cluster structure parameters: The enhanced Hoshen-Kopelman algorithm

An enhanced Hoshen-Kopelman (EHK) algorithm for calculating cluster structure parameters is presented for the site percolation problem. The EHK algorithm enables efficient calculation of cluster

Introduction To Percolation Theory

Preface to the Second Edition Preface to the First Edition Introduction: Forest Fires, Fractal Oil Fields, and Diffusion What is percolation? Forest fires Oil fields and fractals Diffusion in

Characteristics of the Electrical Percolation in Carbon Nanotubes/Polymer Nanocomposites

We study the onset of electrical percolation in multiwalled carbon nanotubes (MWNTs)/epoxy nanocomposites. Experiments show a threshold value of 3.2 wt % of MWNTs for percolation to occur.