Percolation transition of strongly connected clusters in finite dimensions and on complete graphs
Qi Wang, and Ming Li

TL;DR
This study investigates the percolation of strongly connected clusters in directed systems across various dimensions, revealing fractal properties below the upper critical dimension and mean-field behavior above it, with unique size distribution features on complete graphs.
Contribution
It provides a comprehensive analysis of SCC percolation in finite dimensions and complete graphs, highlighting the transition from fractal to mean-field behavior and discovering a double-scaling structure in size distributions.
Findings
Critical SCCs are fractal with dimension $d_{SCC}$ below $d_u=6$.
Size distribution follows a hyperscaling relation $ au_{SCC}=1+d/d_{SCC}$ below $d_u$.
Complete graphs show a double-scaling structure with different exponents for large and small SCCs.
Abstract
We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension to and complete graphs. Below the upper critical dimension , the critical SCCs exhibit nontrivial fractal dimension , and the size distribution scales as with the hyperscaling relation . For , mean-field behavior is recovered with , consistent with complete-graph results. However, in contrast to hypercubic lattices, complete graphs exhibit a double-scaling structure in the SCC size distribution: large SCCs are governed by mean-field value , while small SCCs follow a distinct power law with exponent . At criticality,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
