Percolation thresholds for discrete-continuous models with non-uniform probabilities of bond formation
arXiv:1509.07401 · doi:10.1103/PhysRevE.93.022127
Abstract
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing effective computation of both universal and modelspecific percolation quantities in the case when both random processes are Poisson processes. The algorithm extends percolation algorithm by Newman and Ziff (M.E.J. Newman and R.M. Ziff, Phys Rev E, 64(1):016706, 2001) to handle inhomogeneous lattices. In particular, we use the proposed method to compute critical exponents and cluster density distribution in two and three dimensions for the model of parallel random tubes connected randomly by bonds, which models the connectivity properties of activated carbon.
arXiv comment10 pages, 8 figures
References in corpus (4)
- A fast Monte Carlo algorithm for site or bond percolation
- Efficient Monte Carlo algorithm and high-precision results for percolation
- Transport in weighted networks: Partition into superhighways and roads
- Site-Percolation Threshold of Carbon Nanotube Fibers: Fast Inspection of Percolation with Markov Stochastic Theory