arrow
返回

ARE FOREST FIRES PREDICTABLE?

delete2011-11-21
delete0
delete
OA
AI
DOI:10.1142/s0129183102003760delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
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 pn → pn + 1, where pn 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.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

暂无期刊信息

机构

暂无机构信息
引用论文

引用论文

暂无论文信息