Related papers: Asymptotics of one-dimensional forest fire process…
Tree-grass coexistence in savanna ecosystems depends strongly on environmental disturbances out of which crucial is fire. Most modeling attempts in the literature lack stochastic approach to fire occurrences which is essential to reflect…
It is relatively easy to construct a finitely generated group with infinite asymptotic dimension: the restricted wreath product of $\mathbb{Z}$ by $\mathbb{Z}$ provides an example. In light of this, it becomes interesting to consider the…
We show how clustering as a general hierarchical dynamical process proceeds via a sequence of inverse cascades to produce self-similar scaling, as an intermediate asymptotic, which then truncates at the largest spatial scales. We show how…
Self-destructive percolation with parameters $p,\delta$ is obtained by taking a site percolation configuration with parameter $p$, closing all sites belonging to infinite clusters, then opening every closed site with probability $\delta$,…
A method for creating a forest of model trees to fit samples of a function defined on images is described in several steps: down-sampling the images, determining a tree's hyperplanes, applying convolutions to the hyperplanes to handle small…
We study a parabolic free boundary problem, arising from a model for the propagation of equi-diffusional premixed flames with high activation energy. If an initial data is compactly supported, then the solution vanishes in a finite time,…
Forest fire prediction involves estimating the likelihood of fire ignition or related risk levels in a specific area over a defined time period. With climate change intensifying fire behavior and frequency, accurate prediction has become…
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…
We study one specific version of the contact process on a graph. Here, we allow multiple infections carried by the nodes and include a probability of removing nodes in a graph. The removal probability is purely determined by the number of…
Amongst the numerous models introduced with SOC, the Forest Fire Model (FFM) is particularly attractive for its close relationship to stochastic spreading, which is central to the study of systems as diverse as epidemics, rumours, or…
We show by extensive simulations that the whole supercritical phase of the three-dimensional uniform forest model simultaneously exhibits an infinite tree and a rich variety of critical phenomena. Besides typical scalings like algebraically…
Suppose that a circular fire spreads in the plane at unit speed. A single fire fighter can build a barrier at speed $v>1$. How large must $v$ be to ensure that the fire can be contained, and how should the fire fighter proceed? We…
We present a systematic study of corrections to scaling in the self-organized critical forest-fire model. The analysis of the steady-state condition for the density of trees allows us to pinpoint the presence of these corrections, which…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
We study the asymptotic behaviour of a properly normalized time changed Wiener processes. The time change reflects the fact that we consider the Laplace operator (which generates a Wiener process) multiplied by a possibly degenerate…
We consider the problem of locating the source of a network cascade, given a noisy time-series of network data. Initially, the cascade starts with one unknown, affected vertex and spreads deterministically at each time step. The goal is to…
In this paper, we study the asymptotic behavior, as the time $t$ goes to zero, of the trace of the semigroup of a killed relativistic $\alpha$-stable process in bounded $C^{1,1}$ open sets and bounded Lipschitz open sets. More precisely, we…
We study a percolation process on the planted binary tree, where clusters freeze as soon as they become larger than some fixed parameter N. We show that as N goes to infinity, the process converges in some sense to the frozen percolation…
Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their…
For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure. The proof is based on the martingale central limit theorem…