Critical percolation clusters in seven dimensions and on a complete graph.

Abstract

We study critical bond percolation on a seven-dimensional hypercubic lattice with periodic boundary conditions (7D) and on the complete graph (CG) of finite volume (number of vertices) 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)∼s^{-τ}n[over ̃](s/V^{d_{f}^{*}}) with identical volume fractal dimension d_{f}^{*}=2/3 and exponent τ=1+1/d_{f}^{*}=5/2. We then classify occupied bonds into bridge bonds, which includes branch and junction bonds, and nonbridge 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 leaf-free configurations, whereas deleting all bridge bonds leads to bridge-free configurations composed of blobs. It is shown that the fraction of nonbridge (biconnected) bonds vanishes, ρ_{n,CG}→0, for large CGs, but converges to a finite value, ρ_{n,7D}=0.0061931(7), for the 7D hypercube. Further, we observe that while the bridge-free dimension d_{bf}^{*}=1/3 holds for both the CG and 7D cases, the volume fractal dimensions of the leaf-free clusters are different: d_{lf,7D}^{*}=0.669(9)≈2/3 and d_{lf,CG}^{*}=0.3337(17)≈1/3. On the CG and in 7D, the whole, leaf-free, and bridge-free clusters all have the shortest-path volume fractal dimension d_{min}^{*}≈1/3, characterizing their graph diameters. 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 ∼lnV, while for 7D they scale as ∼V. For the size distribution, we find the behavior on the CG is governed by a modified Fisher exponent τ^{'}=1, while for leaf-free clusters in 7D, it is governed by Fisher exponent τ=5/2. The size distribution of bridge-free clusters in 7D displays two-scaling behavior with exponents τ=4 and τ^{'}=1. The probability distribution P(C_{1},V)dC_{1} of the largest cluster of size C_{1} for whole percolation configurations is observed to follow a single-variable function P[over ¯](x)dx, with x≡C_{1}/V^{d_{f}^{*}} for both CG and 7D. Up to a rescaling factor for the variable x, the probability functions for CG and 7D collapse on top of each other within the entire range of x. The analytical expressions in the x→0 and x→∞ limits are further confirmed. Our work demonstrates that the geometric structure of high-dimensional percolation clusters cannot be fully accounted for by their complete-graph counterparts.