Fires on large recursive trees

DOI10.1016/J.SPA.2015.08.006zbMATH Open1327.60191arXiv1410.7671OpenAlexW1593398189MaRDI QIDQ898408FDOQ898408

Authors: Cyril Marzouk 

Publication date: 8 December 2015

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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 $p_n$ or fireproof with probability $1-p_n$. Fires propagate in the tree and are only stopped by fireproof edges. We first consider the proportion of burnt and fireproof vertices as $noinfty$, and prove a phase transition when $p_n$ 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.

Full work available at URL: https://arxiv.org/abs/1410.7671

Recommendations

• Fires on trees
• The cut-tree of large recursive trees
• On the sizes of burnt and fireproof components for fires on a large Cayley tree
• Percolation on random recursive trees
• Cutting edges at random in large recursive trees

zbMATH Keywords

percolationrandom recursive treescluster sizesfire model

Mathematics Subject Classification ID

Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Random recursive trees and the Bolthausen-Sznitman coalescent
• Random trees and applications
• The continuum random tree. III
• A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
• Cutting down recursive trees
• Fires on trees
• The cut-tree of large recursive trees
• Sizes of the largest clusters for supercritical percolation on random recursive trees
• Cutting down random trees
• Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
• Erdős-Renyi random graphs \(+\) forest fires \(=\) self-organized criticality
• Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
• Stable probability distributions and their domains of attraction: A direct approach
• Almost giant clusters for percolation on large trees with logarithmic heights
• A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
• Mean field frozen percolation
• Multiple isolation of nodes in recursive trees
• On the sizes of burnt and fireproof components for fires on a large Cayley tree

Cited In (6)

• A growth-fragmentation-isolation process on random recursive trees and contact tracing
• Firefighting on trees
• On the sizes of burnt and fireproof components for fires on a large Cayley tree
• Asymptotic results on Hoppe trees and their variations
• Fires on trees
• A stochastic combustion model with thresholds on trees

This page was built for publication: Fires on large recursive trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898408)