Critical percolation clusters in seven dimensions and on a complete graph

Abstract

We study critical bond percolation on a seven-dimensional (7D) hypercubic lattice with periodic boundary conditions and on the complete graph (CG) of finite volume $V$. We numerically confirm that for both cases, the critical number density $n(s,V)$ of clusters of size $s$ obeys a scaling form $n(s,V)\sim s^{-\tau }\tilde{n}(s/V^{d_{\mathrm{f}}^{\ast }})$ with identical volume fractal dimension $d_{\mathrm{f}}^{\ast }=2/3$ and exponent $\tau =1+1/d_{\mathrm{f}}^{\ast }=5/2$. We then classify occupied bonds into {\em bridge} bonds, which includes {\em branch} and {\em junction} bonds, and {\em non-bridge} bonds; a bridge bond is a branch bond if and only if its deletion produces at least one tree. Deleting branch bonds from percolation configurations produces {\em leaf-free} configurations, whereas, deleting all bridge bonds leads to {\em bridge-free} configurations. It is shown that the fraction of non-bridge (bi-connected) bonds vanishes ${\rho }_{\mathrm{n},\mathrm{CG}}$$\to$0 for large CGs, but converges to a finite value ${\rho }_{\mathrm{n},7D}=0.0061931(7)$ for the 7D hypercube. Further, we observe that while the bridge-free dimension $d_{\mathrm{bf}}^{\ast }=1/3$ holds for both the CG and 7D cases, the volume fractal dimensions of the leaf-free clusters are different: $d_{\mathrm{\ell }\mathrm{f},7D}^{\ast }=0.669(9)\approx 2/3$ and $d_{\mathrm{\ell }\mathrm{f},\mathrm{CG}}^{\ast }=0.3337(17)\approx 1/3$. We also study the behavior of the number and the size distribution of leaf-free and bridge-free clusters. For the number of clusters, we numerically find the number of leaf-free and bridge-free clusters on the CG scale as $\sim \ln V$, while for 7D they scale as $\sim V$. Our work demonstrates that the geometric structure of high-dimensional percolation clusters cannot be fully accounted for by their complete-graph counterparts.

10 pages, 7 figures, 5 tables

References in corpus (5)

• Recent advances and open challenges in percolation
• Critical random graphs: Diameter and mixing time
• Kinetic Theory of Random Graphs: from Paths to Cycles
• Complete graph asymptotics for the Ising and random cluster models on 5D grids with cyclic boundary
• Pattern theorems, ratio limit theorems and Gumbel maximal clusters for random fields

Cited by in corpus (19)

• Percolation on complex networks: Theory and application
• Percolation Thresholds and Fisher Exponents in Hypercubic Lattices
• Geometric properties of the Fortuin-Kasteleyn representation of the Ising model
• Equivalent-neighbor percolation models in two dimensions: crossover between mean-field and short-range behavior
• Finite-size Scaling of O($n$) Systems at the Upper Critical Dimensionality
• Complete graph and Gaussian fixed point asymptotics in the five-dimensional Fortuin-Kasteleyn Ising model with periodic boundaries
• Geometric scaling behaviors of the Fortuin-Kasteleyn Ising model in high dimensions
• Critical exponents and universal excess cluster number of percolation in four and five dimensions
• $N$-cluster correlations in four- and five-dimensional percolation
• Bond percolation between $k$ separated points on a square lattice
• Backbone and shortest-path exponents of the two-dimensional $Q$-state Potts model
• Percolation effects in the Fortuin-Kasteleyn Ising model on the complete graph
• Towards Deepening Graph Neural Networks: A GNTK-based Optimization Perspective
• Geometric properties of the complete-graph Ising model in the loop representation
• Emergence of biconnected clusters in explosive percolation
• Percolation thresholds on high dimensional $D_n$ and dense packing lattices
• Finite-Size Scaling of the High-Dimensional Ising Model in the Loop Representation
• Universality of the complete-graph Potts model with $0<q\le 2$
• Fractal depth-first search paths in statistical physics models