Using MC simulations based on an efficient single-cluster growth algorithm, we investigate two types of three-dimensional extended-range percolation models, namely cubic and complex (non-compact) neighborhoods. We obtain high-precision percolation thresholds $p_c$ for approximately 100 distinct structures and further explore the relationship between these thresholds and the topology of the lattices, which includes the total coordination number $z$, the number of sites $z_i$ and these sites'distance to the central site $r_i$ of the given neighborhood in the $i$th coordination zone. Both bond and site percolation are analyzed for cubic neighborhoods on the SC lattice. For bond percolation, the asymptotic value of $zp_c$ tends to Bethe-lattice behavior ($zp_c\sim1$), and finite-$z$ correction is found to be consistent with $zp_{c}-1\sim a_{1}z^{-x}$, where $x=(d-1)/d$. For site percolation, the value of $zp_c$ varies non-monotonically, exhibiting an initial increase followed by a decrease with the coordination number $z$. Linear fitting leads to $zp_c\sim2.5987(1)$ for large $z$, predicting a value of continuum percolation threshold of aligned cubes $\eta_c=0.324838(12)$ using $zp_c=2^{d}\eta_c$. We then examine site percolation for non-compact neighborhoods extending to the fifth coordination zone on SC, FCC, and BCC lattices. Through a comparison of the three indices of $z$, $\xi=\sum_iz_ir_i^2/i$, and $\zeta=\sum_iz_ir_i$, we find that $\zeta$ is effective in removing the degeneracy. The results obtained show power-law dependence $p_c\propto(\zeta/K)^{-\gamma}$ with $\gamma_{\mathrm{SC}}^{\zeta}=0.703(12)$, $\gamma_{\mathrm{FCC}}^{\zeta}=0.728(10)$, and $\gamma_{\mathrm{BCC}}^{\zeta}=0.699(12)$ for SC, FCC, and BCC lattices, and $p_c\propto\zeta^{-\gamma}$ with $\gamma^{\zeta}=0.719(9)$ independent of the underlying lattice. The number $K$ indicates lattice connectivity.
We study bond percolation on the one-dimensional lattice in which two sites at distance $r$ are connected with probability $p_r=C/r^{1+\sigma}$, where $0<\sigma<1$. An infinite cluster exists if $C$ exceeds a critical value $C_c(\sigma)$, which is not known exactly: the available results are the lower bound of Schulman...
We determine the site and bond percolation thresholds of all 23,396 $k$-uniform tilings of the plane by regular polygons with $k\le 10$, the complete set according to the known enumeration. We use Monte Carlo simulation on tori and the condition that no wrapping and a cross-wrapping cluster are equally probable, the Mo...
We consider independent long-range bond percolation on $\mathbb{Z}^d$ in which $x$ and $y$ are joined with probability $1-e^{-\beta J(x-y)}$. Let $d\ge2$ and let $J$ be invariant under coordinate permutations and sign changes, positive on nearest-neighbour pairs, and satisfy $\liminf_{n\to\infty} n^d\sum_{\|x\|>n}J(x)=...
We study the two-dimensional anisotropic three-state Potts ferromagnet on the square lattice using Wolff single-cluster Monte Carlo simulations and finite-size scaling. For coupling ratios $\lambda=J_y/J_x=0.5$, $0.75$, and $1$, finite-size scaling of the correlation ratio yields critical behavior consistent with the t...
To bridge the gap between worst-case and heuristic analyses of lattice enumeration, we study the sizes of (unpruned) enumeration trees on $n$-dimensional Haar-random lattices. Writing $n^{cn+o(n)}$ for the tree size at the shortest vector radius, we investigate the asymptotic scaling of $c$, and which bases minimize it...
We study the emergence of a mutual giant component in a multiplex network comprised of two one-dimensional long-range networks on a lattice. The probability that two nodes on one lattice, with a distance $r$ between them, are connected with an edge falls algebraically with distance as $Cr^{-(1+\sigma)}$, where $0<\sigm...
Adar Sharabi, A. Bashan, S. Buldyrev et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.