Mean field frozen percolation

Abstract

We define a modification of the Erdos-Renyi random graph process which can be regarded as the mean field frozen percolation process. We describe the behavior of the process using differential equations and investigate their solutions in order to show the self-organized critical and extremum properties of the critical frozen percolation model. We prove two limit theorems about the distribution of the size of the component of a typical frozen vertex.

Cited by in corpus (12)

• Random spanning forests and hyperbolic symmetry
• Rigid representations of the multiplicative coalescent with linear deletion
• Fires on large recursive trees
• Self-organized criticality in a discrete model for Smoluchowski's equation with limited aggregations
• Frozen percolation on inhomogeneous random graphs
• Some toy models of self-organized criticality in percolation
• Well-posedness of the mean field forest fire age evolution equation
• Age evolution in the mean field forest fire model via multitype branching processes
• Power-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphism
• Near-critical avalanches in 2D frozen percolation and forest fires
• Parking on Cayley trees & Frozen Erdös-Rényi
• Frozen percolation in two dimensions