Are forest fires predictable?
Dynamic mean field theory is applied to the problem of forest fires. The starting point is the Monte Carlo simulation in a lattice of a million cells. The statistics of the clusters is obtained by means of the Hoshen-Kopelman algorithm. We get the map p(n) --> p(n+1), where P-n is the probability of finding a tree in a cell, and n is the discrete time. We demonstrate that the time evolution of p is chaotic. The arguments are provided by the calculation of the bifurcation diagram and the Lyapunov exponent. The bifurcation diagram reveals several windows of stability, including periodic orbits of length three, five and seven. For smaller lattices, the results of the iteration are in qualitative agreement with the statistics of the forest fires in Canada in the years 1970-2000.
cellular automata chaos percolation symbolic dynamics