Abstract
We consider random dynamics on a uniform random recursive tree with n vertices. Successively, in a uniform random order, each edge is either set on fire with some probability pn or fireproof with probability 1-pn. Fires propagate in the tree and are only stopped by fireproof edges. We first consider the proportion of burnt and fireproof vertices as n→∞, and prove a phase transition when pn is of order lnn/n. We then study the connectivity of the fireproof forest, more precisely the existence of a giant component. We finally investigate the sizes of the burnt subtrees.
| Original language | English |
|---|---|
| Pages (from-to) | 265-289 |
| Number of pages | 25 |
| Journal | Stochastic Processes and their Applications |
| Volume | 126 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2016 |
| Externally published | Yes |
Keywords
- Cluster sizes
- Fire model
- Percolation
- Random recursive trees
Fingerprint
Dive into the research topics of 'Fires on large recursive trees'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver