Related papers: Forest fires on $\Z_+$ with ignition only at 0
The role of forest heterogeneity in the long-term, large-scale dynamics of forest fires is investigated by means of a cellular automata model and mean field approximation. Heterogeneity was conceived as trees (or acres of forest) with…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step,…
Let $G$ be a connected graph in which almost all vertices have linear degrees and let $T$ be a uniform spanning tree of $G$. For any fixed rooted tree $F$ of height $r$ we compute the asymptotic density of vertices $v$ for which the…
The edge blow-up of a graph $G$, denoted by $G^{p+1}$, is obtained by replacing each edge of $G$ with a clique of order $p+1$, where the new vertices of the cliques are all distinct. Yuan [J. Comb. Theory, Ser. B, 152 (2022) 379-398]…
We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random recursive trees. Using this representation, we prove results concerning the final collision of the coalescent restricted to [n]: we show…
We show that the contact process on a random $d$-regular graph initiated by a single infected vertex obeys the "cutoff phenomenon" in its supercritical phase. In particular, we prove that when the infection rate is larger than the critical…
Given a graph $G=(V, E)$, the problem of Graph Burning is to find a sequence of nodes from $V$, called a burning sequence, to burn the whole graph. This is a discrete-step process, and at each step, an unburned vertex is selected as an…
Let $G$ be a graph on $n$ vertices. A linear forest is a graph consisting of vertex-disjoint paths and isolated vertices. A maximum linear forest of $G$ is a subgraph of $G$ with maximum number of edges, which is a linear forest. We denote…
We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may be permanently placed on an unburned vertex and…
What is the maximum number of copies of a fixed forest $T$ in an $n$-vertex graph in a graph class $\mathcal{G}$ as $n\to \infty$? We answer this question for a variety of sparse graph classes $\mathcal{G}$. In particular, we show that the…
The Firefighting problem is defined as follows. At time $t=0$, a fire breaks out at a vertex of a graph. At each time step $t \geq 0$, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all…
Liminal burning generalizes both the burning and cooling processes in graphs. In $k$-liminal burning, a Saboteur reveals $k$-sets of vertices in each round, with the goal of extending the length of the game, and the Arsonist must choose…
Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph…
Starting from any graph on $\{1, \ldots, n\}$, consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected to another uniformly chosen vertex. This Markov chain has a…
The Arboreal gas model on a finite graph $G$ is the Bernoulli bond percolation on $G$ conditioned on the event that the sampled subgraph is a forest. In this short note we study the arboreal gas on a regular tree wired at the leaves and…