Related papers: Continuum Percolation Thresholds in Two Dimensions
We study a process termed "agglomerative percolation" (AP) in two dimensions. Instead of adding sites or bonds at random, in AP randomly chosen clusters are linked to all their neighbors. As a result the growth process involves a diverging…
We use SLE(6) paths to construct a process of continuum nonsimple loops in the plane and prove that this process coincides with the full continuum scaling limit of 2D critical site percolation on the triangular lattice -- that is, the…
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…
By use of conformal field theory, we discover several exact factorizations of higher-order density correlation functions in critical two-dimensional percolation. Our formulas are valid in the upper half-plane, or any conformally equivalent…
Monte Carlo simulations are performed to determine the critical percolation threshold for interpenetrating square objects in two dimensions and cubic objects in three dimensions. Simulations are performed for two cases: (i) objects whose…
The square lattice with central forces between nearest neighbors is isostatic with a subextensive number of floppy modes. It can be made rigid by the random addition of next-nearest neighbor bonds. This constitutes a rigidity percolation…
Several formulas for crossing functions arising in the continuum limit of critical two-dimensional percolation models are studied. These include Watts's formula for the horizontal-vertical crossing probability and Cardy's new formula for…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
We observed a phase transition-like behavior that is marked by the onset of the realization of the connectivity between two sites on a two-dimensional cross-section of a three-dimensional percolation cluster. This was found using…
We present a fine-grained approach to identify clusters and perform percolation analysis in a 2D lattice system. In our approach, we develop an algorithm based on the linked-list data structure whereby the members of a cluster are nodes of…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
The two-dimensional site percolation problem is studied by transfer-matrix methods on finite-width strips with free boundary conditions. The relationship between correlation-length amplitudes and critical indices, predicted by conformal…
Percolation is a cornerstone concept in physics, providing crucial insights into critical phenomena and phase transitions. In this study, we adopt a kinetic perspective to reveal the scaling behaviors of higher-order gaps in the largest…
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…
The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…
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…
Using methods of conformal field theory, we conjecture an exact form for the probability that n distinct clusters span a large rectangle or open cylinder of aspect ratio k, in the limit when k is large.
We study the transport properties of directed percolation clusters at the upper critical dimension $d_{c} = 4+1$, where critical fluctuations induce logarithmic corrections to the leading (mean-field) scaling behavior. Employing field…
The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…
We investigate bond- and site-percolation models on several two-dimensional lattices numerically, by means of transfer-matrix calculations and Monte Carlo simulations. The lattices include the square, triangular, honeycomb kagome and diced…