相关论文: Percolation in Finite Matching Lattices

In a statistical cluster or loop model such as percolation, or more generally the Potts models or O(n) models, a pinch point is a single bulk point where several distinct clusters or loops touch. In a polygon P harboring such a model in its…

We test the universal finite-size scaling of the cluster mass order parameter in two-dimensional (2D) isotropic and directed continuum percolation models below the percolation threshold by computer simulations. We found that the simulation…

We consider the density at a point z = x + i y of critical percolation clusters that touch the left [P_L(z)], right [P_R(z)], or both [P_{LR}(z)] sides of a rectangular system, with open boundary conditions on the top and bottom. The ratio…

We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…

We present a simple one-dimensional model with molecular interactions favouring the formation of clusters with a defined optimal size. Increasing the density, at low temperature, the system goes from a nearly-ideal gas of independent…

We present a study of site and bond percolation on periodic lattices with (on average) fewer than three nearest neighbors per site. We have studied this issue in two contexts: By simulating oxides with a mixture of 2-coordinated and…

We define a continuum percolation model that provides a collection of random ellipses on the plane and study the behavior of the covered set and the vacant set, the one obtained by removing all ellipses. Our model generalizes a construction…

A simple finite-size scaling theory is proposed here for anisotropic percolation models considering the cluster size distribution function as generalized homogeneous function of the system size and two connectivity lengths. The proposed…

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…

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…

We give a self-contained and detailed presentation of Kesten's results that allow to relate critical and near-critical percolation on the triangular lattice. They constitute an important step in the derivation of the exponents describing…

The methods of conformal field theory are used to compute the crossing probabilities between segments of the boundary of a compact two-dimensional region at the percolation threshold. These probabilities are shown to be invariant not only…

We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…

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…

We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For $d=2$ they clearly…

The probability distributions of the masses of the clusters spanning from top to bottom of a percolating lattice at the percolation threshold are obtained in all dimensions from two to five. The first two cumulants and the exponents for the…

Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…

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…

It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…

We use very efficient algorithms to calculate low-density series for bond and site percolation on the directed triangular, honeycomb, kagom\'e, and $(4.8^2)$ lattices. Analysis of the series yields accurate estimates of the critical point…