Related papers: Percolation thresholds of two-dimensional continuu…
Space filling designs are central to studying complex systems in various areas of science. They are used for obtaining an overall understanding of the behaviour of the response over the input space, model construction and uncertainty…
We examine the interplay between anisotropy and percolation, i.e., the spontaneous formation of a system spanning cluster in an anisotropic model. We simulate an extension of a benchmark model of continuum percolation, the Boolean model,…
A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph…
Scale-invariant universal crossing probabilities are studied for critical anisotropic systems in two dimensions. For weakly anisotropic standard percolation in a rectangular-shaped system, Cardy's exact formula is generalized using a…
We present a Monte Carlo study of the bond and site directed (oriented) percolation models in $(d+1)$ dimensions on simple-cubic and body-centered-cubic lattices, with $2 \leq d \leq 7$. A dimensionless ratio is defined, and an analysis of…
The goal of this effort is to establish the conditions and limits under which the Huygens-Fresnel principle accurately describes diffraction in the Monte Carlo ray-trace environment. This goal is achieved by systematic intercomparison of…
We show that the correction-to-scaling exponents in two-dimensional percolation are bounded by Omega <= 72/91, omega = D Omega <= 3/2, and Delta_1 = nu omega <= 2, based upon Cardy's result for the critical crossing probability on an…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
Percolation problems appear in a large variety of different contexts ranging from the design of composite materials to vaccination strategies on community networks. The key observable for many applications is the percolation threshold.…
We study continuum percolation of overlapping circular discs of two sizes. We propose a phenomenological scaling equation for the increase in the effective size of the larger discs due to the presence of the smaller discs. The critical…
In a Monte Carlo study the conductivity of two-dimensional random stick systems is investigated from the percolation threshold up to ten times the percolation threshold density. We propose a model explicitly depending on the stick density…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…
In a recent article, one of the authors used $c=0$ logarithmic conformal field theory to predict crossing-probability formulas for percolation clusters inside a hexagon with free boundary conditions. In this article, we verify these…
A set of discrete individual points located in an embedding continuum space can be seen as percolating or non-percolating, depending on the radius of the discs/spheres associated with each of them. This problem is relevant in theoretical…
In composite materials composed of soft polymer matrix and stiff, high-aspect-ratio particles, the composite undergoes a transition in mechanical strength when the inclusion phase surpasses a critical density. This phenomenon (rheological…
The finite-size scaling behaviour for percolation and conduction is studied in two-dimensional triangular-shaped random resistor networks at the percolation threshold. The numerical simulations are performed using an efficient star-triangle…
In this work we apply a highly efficient Monte Carlo algorithm recently proposed by Newman and Ziff to treat percolation problems. The site and bond percolation are studied on a number of lattices in two and three dimensions. Quite good…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
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…