Related papers: Fires on trees

We introduce a model of evolving preferential attachment trees where vertices are assigned weights, and the evolution of a vertex depends not only on its own weight, but also on the weights of its neighbours. We study the distribution of…

Consider a model of fire spreading through a graph; initially some vertices are burning, and at every given time-step fire spreads from burning vertices to their neighbours. The firefighter problem is a solitaire game in which a player is…

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…

We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a factor of iid percolation (jointly unimodular subgraph) that is…

A geometric model for the computation of the firefront of a forest wildfire which takes into account several effects (possibly time-dependent wind, anisotropies and slope of the ground) is introduced. It relies on a general theoretical…

We call a pair of vertex-disjoint, induced subtrees of a rooted trees twins if they have the same counts of vertices by out-degrees. The likely maximum size of twins in a uniformly random, rooted Cayley tree of size $n\to\infty$ is studied.…

Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…

We consider the Williams Bjerknes model, also known as the biased voter model on the $d$-regular tree $\bbT^d$, where $d \geq 3$. Starting from an initial configuration of "healthy" and "infected" vertices, infected vertices infect their…

The contact process is a simple model for the spread of an infection in a structured population. We investigate the case when the underlying structure evolves dynamically as a degree-dependent dynamical percolation model. Starting with a…

We define a notion of stochastic domination between trees, where one tree dominates another if when the vertices of each are labeled with independent, identically distributed random variables, one tree is always more likely to contain a…

An infection spreads in a binary tree of height n as follows: initially, each leaf is either infected by one of k states or it is not infected at all. The infection state of each leaf is independently distributed according to a probability…

We show that a randomly perturbed digraph, where we start with a dense digraph $D_\alpha$ and add a small number of random edges to it, will typically contain a fixed orientation of a bounded degree spanning tree. This answers a question…

Let $X_1,X_2,...$ be an infinite sequence of i.i.d. random vectors distributed exponentially with parameter $\lam .$ For each $y$ and $n\geq 1,$ form a graph $G_n(y)$ with vertex set $V_n = \{X_1,...,X_n\},$ two vertices are connected if…

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to…

In the classical Drossel-Schwabl forest fire process, vertices of a lattice become occupied at rate $1$, and they are hit by lightning at some tiny rate $\zeta > 0$, which causes entire connected components to burn. In this paper, we study…

We study forest fire processes in two dimensions. On a given planar lattice, vertices independently switch from vacant to occupied at rate $1$ (initially they are all vacant), and any connected component "is burnt" (its vertices become…

We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…

We consider the one-dimensional generalized forest fire process: at each site of $\zz$, seeds and matches fall according some i.i.d. stationary renewal processes. When a seed falls on an empty site, a tree grows immediately. When a match…

We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saram\"aki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and…