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 ${\overline{p}}_{ck}$ 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 $p_{ck}$ for individual samples remains broad in the limit of $L\to \infty$. We study ${\overline{p}}_{ck}$ for bond percolation on the square lattice, and find that ${\overline{p}}_{ck}$ are above the normal percolation threshold $p_c=1/2$ and represent specific supercritical states. The ${\overline{p}}_{ck}$ can be related to integrals over powers of the function $P_{\infty }(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_{\infty }(p)$ on $L\times L$ systems that, for $L\to \infty$, ${\overline{p}}_{c1}=0.51755(5)$, ${\overline{p}}_{c2}=0.53219(5)$, ${\overline{p}}_{c3}=0.54456(5)$, and ${\overline{p}}_{c4}=0.55527(5).$ The percolation thresholds ${\overline{p}}_{ck}$ 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/{\nu }_k}$ where ${\nu }_k=\nu /(k\beta +1)$, with $\beta =5/36$ and $\nu =4/3$ being the ordinary percolation critical exponents, so that ${\nu }_1=48/41$, ${\nu }_2=24/23$, ${\nu }_3=16/17$, ${\nu }_4=6/7$, etc. We also study three-point correlations in the system, and show how for $p>p_c$, the correlation ratio goes to 1 (no net correlation) as $L\to \infty$, while at $p_c$ it reaches the known value of 1.022.

arXiv comment9 pages, 11 figures

References in corpus (18)

• A fast Monte Carlo algorithm for site or bond percolation
• Efficient Monte Carlo algorithm and high-precision results for percolation
• On three-point connectivity in two-dimensional percolation
• Convergence of threshold estimates for two-dimensional percolation
• Percolation of disordered jammed sphere packings
• Percolation Thresholds and Fisher Exponents in Hypercubic Lattices
• Disassortativity of percolating clusters in random networks
• Percolation and jamming of random sequential adsorption samples of large linear $k$-mers on a square lattice
• Critical percolation clusters in seven dimensions and on a complete graph
• A formula for crossing probabilities of critical systems inside polygons
• Equivalent-neighbor percolation models in two dimensions: crossover between mean-field and short-range behavior
• Renormalization group for link percolation on planar hyperbolic manifolds
• Series Expansion of the Percolation Threshold on Hypercubic Lattices
• Jamming and percolation properties of random sequential adsorption with relaxation
• Percolation in a distorted square lattice
• Factorization of percolation density correlation functions for clusters touching the sides of a rectangle
• Percolation model with an additional source of disorder
• Product-Sum universality and Rushbrooke inequality in explosive percolation

Cited by in corpus (7)

• Entanglement generation in a quantum network at distance-independent rate
• Distance-Independent Entanglement Generation in a Quantum Network using Space-Time Multiplexed Greenberger-Horne-Zeilinger (GHZ) Measurements
• Percolation in a simple cubic lattice with distortion
• Site percolation in distorted square and simple cubic lattices with flexible number of neighbors
• Q-factor: A measure of competition between the topper and the average in percolation and in SOC
• Bond percolation in distorted square and triangular lattices
• Site and bond percolation in linearly distorted triangular and square lattices