Fires on trees

Jean Bertoin

Annales de l'I.H.P. Probabilités et statistiques (2012)

  • Volume: 48, Issue: 4, page 909-921
  • ISSN: 0246-0203

Abstract

top
We consider random dynamics on the edges of a uniform Cayley tree with n vertices, in which edges are either flammable, fireproof, or burnt. Every flammable edge is replaced by a fireproof edge at unit rate, while fires start at smaller rate n - α on each flammable edge, then propagate through the neighboring flammable edges and are only stopped at fireproof edges. A vertex is called fireproof when all its adjacent edges are fireproof. We show that as n → ∞ , the terminal density of fireproof vertices converges to 1 when α g t ; 1 / 2 , to 0 when α l t ; 1 / 2 , and to some non-degenerate random variable when α = 1 / 2 . We further study the connectivity of the fireproof forest, in particular the existence of a giant component.

How to cite

top

Bertoin, Jean. "Fires on trees." Annales de l'I.H.P. Probabilités et statistiques 48.4 (2012): 909-921. <http://eudml.org/doc/271957>.

@article{Bertoin2012,
abstract = {We consider random dynamics on the edges of a uniform Cayley tree with $n$ vertices, in which edges are either flammable, fireproof, or burnt. Every flammable edge is replaced by a fireproof edge at unit rate, while fires start at smaller rate $n^\{-\alpha \}$ on each flammable edge, then propagate through the neighboring flammable edges and are only stopped at fireproof edges. A vertex is called fireproof when all its adjacent edges are fireproof. We show that as $n\rightarrow \infty $, the terminal density of fireproof vertices converges to $1$ when $\alpha &gt;1/2$, to $0$ when $\alpha &lt;1/2$, and to some non-degenerate random variable when $\alpha =1/2$. We further study the connectivity of the fireproof forest, in particular the existence of a giant component.},
author = {Bertoin, Jean},
journal = {Annales de l'I.H.P. Probabilités et statistiques},
keywords = {Cayley tree; fire model; percolation; giant component},
language = {eng},
number = {4},
pages = {909-921},
publisher = {Gauthier-Villars},
title = {Fires on trees},
url = {http://eudml.org/doc/271957},
volume = {48},
year = {2012},
}

TY - JOUR
AU - Bertoin, Jean
TI - Fires on trees
JO - Annales de l'I.H.P. Probabilités et statistiques
PY - 2012
PB - Gauthier-Villars
VL - 48
IS - 4
SP - 909
EP - 921
AB - We consider random dynamics on the edges of a uniform Cayley tree with $n$ vertices, in which edges are either flammable, fireproof, or burnt. Every flammable edge is replaced by a fireproof edge at unit rate, while fires start at smaller rate $n^{-\alpha }$ on each flammable edge, then propagate through the neighboring flammable edges and are only stopped at fireproof edges. A vertex is called fireproof when all its adjacent edges are fireproof. We show that as $n\rightarrow \infty $, the terminal density of fireproof vertices converges to $1$ when $\alpha &gt;1/2$, to $0$ when $\alpha &lt;1/2$, and to some non-degenerate random variable when $\alpha =1/2$. We further study the connectivity of the fireproof forest, in particular the existence of a giant component.
LA - eng
KW - Cayley tree; fire model; percolation; giant component
UR - http://eudml.org/doc/271957
ER -

References

top
  1. [1] D. J. Aldous. The continuum random tree III. Ann. Probab.21 (1993) 248–289. Zbl0791.60009MR1207226
  2. [2] D. J. Aldous and J. Pitman. Tree-valued Markov chains derived from Galton–Watson processes. Ann. Inst. H. Poincaré Probab. Stat.34 (1998) 637–686. Zbl0917.60082MR1641670
  3. [3] D. J. Aldous and J. Pitman. The standard additive coalescent. Ann. Probab.26 (1998) 1703–1726. Zbl0936.60064MR1675063
  4. [4] J. Bertoin. Self-similar fragmentations. Ann. Inst. H. Poincaré Probab. Stat.38 (2002) 319–340. Zbl1002.60072MR1899456
  5. [5] J. Bertoin. Random Fragmentation and Coagulation Processes. Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2006. Zbl1107.60002MR2253162
  6. [6] B. Drossel and F. Schwabl. Self-organized critical forest fire model. Phys. Rev. Lett.69 (1992) 1629–1632. 
  7. [7] B. Haas and G. Miermont. The genealogy of self-similar fragmentations with negative index as a continuum random tree. Electron. J. Probab. 9 (2004) 57–97 (electronic). Zbl1064.60076MR2041829
  8. [8] B. Haas and G. Miermont. Scaling limits of Markov branching trees, with applications to Galton–Watson and random unordered trees. Ann. Probab. To appear. Available at http://arxiv.org/abs/1003.3632. Zbl1259.60033MR3050512
  9. [9] B. Haas, G. Miermont, J. Pitman and M. Winkel. Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic models. Ann. Probab.36 (2008) 1790–1837. Zbl1155.92033MR2440924
  10. [10] I. A. Ibragimov and Yu. V. Linnik. Independent and Stationary Sequences of Random Variables. Wolters-Noordhoff, Groningen, 1971. Zbl0219.60027MR322926
  11. [11] S. Janson. Random cutting and records in deterministic and random trees. Random Structures Algorithms29 (2006) 139–179. Zbl1120.05083MR2245498
  12. [12] J. Martin and B. Ráth. Critical mean field frozen percolation and the multiplicative coalescent with linear deletion. In preparation. 
  13. [13] A. Meir and J. W. Moon. Cutting down random trees. J. Australian Math. Soc.11 (1970) 313–324. Zbl0196.27602MR284370
  14. [14] A. Panholzer. Cutting down very simple trees. Quaest. Math.29 (2006) 211–227. Zbl1120.05020MR2233368
  15. [15] Yu. L. Pavlov. The asymptotic distribution of maximum tree size in a random forest. Theor. Probab. Appl.22 (1977) 509–520. Zbl0386.60011MR461619
  16. [16] J. Pitman. Coalescent random forests. J. Combin. Theory Ser. A85 (1999) 165–193. Zbl0918.05042MR1673928
  17. [17] B. Ráth. Mean field frozen percolation. J. Stat. Phys.137 (2009) 459–499. Zbl1181.82034MR2564286

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.