arXiv · 2611.13783
Critical geometry of triconnected clusters in percolation
Abstract
We investigate the critical geometry of triconnected clusters in percolation, which remain connected after the removal of any two sites. By combining biconnected-component decomposition with the SPQR decomposition of graphs, we develop an efficient algorithm for identifying triconnected clusters in large systems. Extensive Monte Carlo simulations yield estimates of the fractal dimension $d_3=1.2308(3)$, $1.083(2)$, and $0.77(2)$ in dimensions $d=2$, $3$, and $4$, respectively, revealing a systematic decrease of $d_3$ with increasing $d$. In dimension $d=6$, the largest triconnected cluster grows logarithmically with system size, whereas on complete graphs, corresponding to $d=\infty$, it approaches a finite size. Both behaviors indicate a vanishing fractal dimension, $d_3=0$, for $d\geq6$. Furthermore, the singular contribution to the susceptibility-like quantity associated with the second moment of the triconnected-cluster size distribution scales as $χ\sim L^{2d_3-d}$. Consequently, it vanishes for $d\geq3$, leaving a finite asymptotic susceptibility, in contrast to the divergent behavior observed in standard percolation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Qi Wang, Youjin Deng, Ming Li. 2026-11-13. Critical geometry of triconnected clusters in percolation. https://searcharxiv.com/abs/2611.13783
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.