Probability distribution and sizes of spanning clusters at the percolation thresholds
Parongama Sen
Abstract
For random percolation at pc, the probability distribution P(n) of the number of spanning clusters (n) has been studied in large scale simulations. The results are compatible with P(n) (-an2) 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 LD where D = d- β/ν for any number of clusters, it shows a smooth decrease as the number of spanning clusters increases.
Create a lesson
Related papers
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov
Replica Transition at Measurement-Altered Ising Criticality
Kabir Khanna, Sara Murciano, Romain Vasseur
Scalene Yang-Baxter triples realize all nearest-neighbour Hamiltonians with global additive symmetries
Pramod Padmanabhan, Somnath Maity, Akash Sinha et al.
Graph-theoretic framework for semi-Markov networks: transient and stationary occupation probabilities, hitting times and weak ergodicity breaking
Julian Voits
Spectral optimization of spherical lattices and applications to classical and quantum interacting spin systems
Jonas Völler, Grigorios Makris, Fabian Hassler et al.
Entropic-ordered superfluid
Isabella Zane, Andrew Lucas