We consider a version of the forest fire model on graph , where each vertex of a graph becomes occupied with rate one. A fixed vertex is hit by lightning with the same rate, and when this occurs, the whole cluster of occupied vertices containing is burnt out. We show that when , the times between consecutive burnouts at vertex , divided by , converge weakly as to a random variable which distribution is where is the Dickman function. We also show that on transitive graphs with a non-trivial site percolation threshold and one infinite cluster at most, the distributions of the time till the first burnout of {\it any} vertex have exponential tails. Finally, we give an elementary proof of an interesting limit: $\lim_{n\to\infty} \sum_{k=1}^n {n \choose k} (-1)^k \log k -\log\log n=\gamma$.

生成讲解博客的中文版本

生成AI智能校验的中文版本