Related papers: Asymptotics of one-dimensional forest fire process…
Recent work has suggested that in highly correlated systems, such as sandpiles, turbulent fluids, ignited trees in forest fires and magnetization in a ferromagnet close to a critical point, the probability distribution of a global quantity…
We study a model for the destruction of a random network by fire. Suppose that we are given a multigraph of minimum degree at least 2 having real-valued edge-lengths. We pick a uniform point from along the length and set it alight; the…
Random forests are a learning algorithm proposed by Breiman [Mach. Learn. 45 (2001) 5--32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical…
In many forest fire incidences, late detection of the fire has lead to severe damages to the forest and human property requiring more resources to gain control over the fire. An early warning and immediate response system can be a promising…
The stable fragmentation with index of self-similarity $\alpha \in [-1/2,0)$ is derived by looking at the masses of the subtrees formed by discarding the parts of a $(1 + \alpha)^{-1}$--stable continuum random tree below height $t$, for $t…
Consider a birth and death process started from one individual in which each individual gives birth at rate $\lambda$ and dies at rate $\mu$, so that the population size grows at rate $r = \lambda - \mu$. Lambert and Harris, Johnston, and…
$\Lambda$-coalescents model genealogies of samples of individuals from a large population by means of a family tree whose branches have lengths. The tree's leaves represent the individuals, and the lengths of the adjacent edges indicate the…
Random Forests have been extensively used in regression and classification, inspiring the development of various forest-based methods. Among these, Mondrian Forests, derived from the Mondrian process, mark a significant advancement.…
A zero-one sequence describes a path through a rooted directed binary tree $T$; it also encodes a real number in $[0,1]$. We regard the level of the external node of $T$ along the path as a function on the unit interval, the silhouette of…
Consider the following class of conformable time-fractional stochastic equation $$T_{\alpha,t}^a u(x,t)=\lambda\sigma(u(x,t))\dot{W}_t,\,\,\,\,x\in\mathbb{R},\,t\in[a,\infty), \,\,0<\alpha<1,$$ with a non-random initial condition…
The Firefighter problem and a variant of it, known as Resource Minimization for Fire Containment (RMFC), are natural models for optimal inhibition of harmful spreading processes. Despite considerable progress on several fronts, the…
Consider critical site percolation on a "nice" planar lattice: each vertex is occupied with probability $p = p_c$, and vacant with probability $1 - p_c$. Now, suppose that additional vacancies ("holes", or "impurities") are created,…
A random forest prediction can be computed by the scalar product of the labels of the training examples and a set of weights that are determined by the leafs of the forest into which the test object falls; each prediction can hence be…
We show that the total number of collisions in the exchangeable coalescent process driven by the beta $(1,b)$ measure converges in distribution to a 1-stable law, as the initial number of particles goes to infinity. The stable limit law is…
We propose a principled method for autoencoding with random forests. Our strategy builds on foundational results from nonparametric statistics and spectral graph theory to learn a low-dimensional embedding of the model that optimally…
Turbulence is of paramount importance in wildland fire propagation since it randomly transports the hot air mass that can pre-heat and then ignite the area ahead the fire. This contributes to give a random character to the firefront…
This study presents a probabilistic surrogate model for localized wildfire spread based on a conditional flow matching algorithm. The approach models fire progression as a stochastic process by learning the conditional distribution of fire…
Given a graph $G=(V,E)$, the problem of \gb{} is to find a sequence of nodes from $V$, called burning sequence, in order to burn the whole graph. This is a discrete-step process, in each step an unburned vertex is selected as an agent to…
We use an infinite $k$-ary tree with a self-loop at the root as our underlying graph. We consider a chip-firing process starting with $N$ chips at the root. We describe the stable configurations. We calculate the number of fires for each…
We consider a class of reinforcement processes, called WARMs, on tree graphs. These processes involve a parameter $\alpha$ which governs the strength of the reinforcement, and a collection of Poisson processes indexed by the vertices of the…