Open Access
2009 Erdos-Renyi random graphs + forest fires = self-organized criticality
Balazs Rath, Balint Toth
Author Affiliations +
Electron. J. Probab. 14: 1290-1327 (2009). DOI: 10.1214/EJP.v14-653

Abstract

We modify the usual Erdos-Renyi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to disconnected single sites) due to a Poisson flow of lightnings. In a range of the intensity of rate of lightnings the system sticks to a permanent.

Citation

Download Citation

Balazs Rath. Balint Toth. "Erdos-Renyi random graphs + forest fires = self-organized criticality." Electron. J. Probab. 14 1290 - 1327, 2009. https://doi.org/10.1214/EJP.v14-653

Information

Accepted: 15 June 2009; Published: 2009
First available in Project Euclid: 1 June 2016

zbMATH: 1197.60093
MathSciNet: MR2511285
Digital Object Identifier: 10.1214/EJP.v14-653

Subjects:
Primary: 60K35

Keywords: Erdos-Renyi random graph , forest fire model , Self-organized criticality , Smoluchowski coagulation equations

Vol.14 • 2009
Back to Top