Cluster Probability in Bootstrap Percolation
A. B. Harris, Andrea J. Liu
TL;DR
This paper introduces a recursive formula to calculate the probability of k-clusters in bootstrap percolation, advancing the understanding of cluster formation in this process.
Contribution
The paper presents a novel recursive approach for determining cluster probabilities in bootstrap percolation, which was not previously available.
Findings
Derived a recursive formula for cluster probabilities
Enhanced analytical tools for bootstrap percolation analysis
Potential applications in network robustness studies
Abstract
We develop a recursive formula for the probability of a k-cluster in bootstrap percolation.
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.
Taxonomy
TopicsBayesian Methods and Mixture Models · Complex Network Analysis Techniques · Stochastic processes and statistical mechanics