Erdos-Renyi random graphs + forest fires = self-organized criticality

Details Erdos-Renyi random graphs + forest fires = self-organized criticality Erdos-Renyi random graphs + forest fires = self-organized criticality

2008-08-15

arxiv.org/abs/0808.2116v3

Electronic Journal of Probability,Vol. 14 (2009), Paper no. 45, pages 1290-1327

Mathematics

Probability

Version 3, dated 18 May 2009, final version, revised after referees' reports

Scientific paper

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 critical state.

Affiliated with

Also associated with

No associations

Rating

Erdos-Renyi random graphs + forest fires = self-organized criticality does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Erdos-Renyi random graphs + forest fires = self-organized criticality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Erdos-Renyi random graphs + forest fires = self-organized criticality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-651098