Erdős-Renyi random graphs + forest fires = self-organized criticality.
Rath, Balazs ; Toth, Balint
Electronic Communications in Probability [electronic only], Tome 14 (2009), p. 1290-1327 / Harvested from The Electronic Library of Mathematics
Publié le : 2009-01-01
EUDML-ID : urn:eudml:doc:226786
@article{05636616,
     title = {Erd\H os-Renyi random graphs },
     journal = {Electronic Communications in Probability [electronic only]},
     volume = {14},
     year = {2009},
     pages = {1290-1327},
     zbl = {1197.60093},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05636616}
}
Rath, Balazs; Toth, Balint. Erdős-Renyi random graphs . Electronic Communications in Probability [electronic only], Tome 14 (2009) pp. 1290-1327. http://gdmltest.u-ga.fr/item/05636616/