Bond percolation between k separated points on a square lattice

Abstract

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 adjacent connected points of a single cluster. These processes yield new thresholds pck defined as the average value of p at which the desired connections first occur. These thresholds are not sharp as the distribution of values of pck for individual samples remains broad in the limit of L ∞. We study pck for bond percolation on the square lattice, and find that pck are above the normal percolation threshold pc = 1/2 and represent specific supercritical states. The pck can be related to integrals over powers of the function P∞(p) equal to the probability a point is connected to the infinite cluster; we find numerically from both direct simulations and from measurements of P∞(p) on L× L systems that, for L ∞, pc1 = 0.51755(5), pc2 = 0.53219(5), pc3 = 0.54456(5), and pc4 = 0.55527(5). The percolation thresholds pck remain the same, even when the k points are randomly selected within the lattice. We show that the finite-size corrections scale as L-1/k where k = /(k β +1), with β=5/36 and =4/3 being the ordinary percolation critical exponents, so that 1= 48/41, 2 = 24/23, 3 = 16/17, 4 = 6/7, etc. We also study three-point correlations in the system, and show how for p>pc, the correlation ratio goes to 1 (no net correlation) as L ∞, while at pc it reaches the known value of 1.022.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…