Probability distribution and sizes of spanning clusters at the percolation thresholds
Parongama Sen

TL;DR
This paper investigates the probability distribution and size variation of spanning clusters at the percolation threshold, revealing an exponential decay in cluster count probability and a scaling relation for cluster sizes.
Contribution
It provides large-scale simulation results showing the distribution of spanning clusters follows an exponential decay and analyzes how average cluster size varies with the number of spanning clusters.
Findings
Probability distribution P(n) ~ exp(-a n^2) for spanning clusters.
Average size of spanning clusters scales as L^D with D = d - β/ν.
Average size decreases smoothly as the number of spanning clusters increases.
Abstract
For random percolation at p_c, the probability distribution P(n) of the number of spanning clusters (n) has been studied in large scale simulations. The results are compatible with for all dimensions. We also study the variation of the average size (mass) of the spanning clusters when there are more than one spanning cluster. While the average size of the spanning clusters scales as usual with where for any number of clusters, it shows a smooth decrease as the number of spanning clusters increases.
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.
