Publication | Open Access
Erdos-Renyi random graphs + forest fires = self-organized criticality
45
Citations
13
References
2009
Year
Cluster ComputingNetwork EvolutionNetwork ScienceGraph TheoryPhysicsSelf-organized CriticalityEngineeringRandom GraphProbabilistic Graph TheoryNetwork AnalysisScale-free NetworkPoisson FlowExtremal Graph TheorySingle SitesNetwork Dynamic
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1