相关论文: Existence of a stationary distribution for multi-d…
Consider the following forest fire model where the possible locations of trees are the sites of $\mathbb{Z}$. Each site has three possible states: 'vacant', 'occupied' or 'burning'. Vacant sites become occupied at rate $1$. At each site,…
We consider the so-called one-dimensional forest fire process. At each site of $\mathbb{Z}$, a tree appears at rate $1$. At each site of $\mathbb{Z}$, a fire starts at rate ${\lambda}>0$, immediately destroying the whole corresponding…
We consider a version of the forest fire model on graph $G$, where each vertex of a graph becomes occupied with rate one. A fixed vertex $v_0$ is hit by lightning with the same rate, and when this occurs, the whole cluster of occupied…
We consider a forest-fire model which, somewhat informally, is described as follows: Each site (vertex) of the square lattice is either vacant or occupied by a tree.Vacant sites become occupied at rate 1. Further, each site is hit by…
Forest fire spreading is a complex phenomenon characterized by a stochastic behavior. Nowadays, the enormous quantity of georeferenced data and the availability of powerful techniques for their analysis can provide a very careful picture of…
Consider the following forest-fire model on the upper half-plane of the triangular lattice: Each site can be "vacant" or "occupied by a tree". At time 0 all sites are vacant. Then the process is governed by the following random dynamics:…
Consider a reflecting diffusion in a domain in $R^d$ that acquires drift in proportion to the amount of local time spent on the boundary of the domain. We show that the stationary distribution for the joint law of the position of the…
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…
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 introduce a phase-field model to describe the dynamics of a self-sustaining propagating combustion front within a medium of randomly distributed reactants. Numerical simulations of this model show that a flame front exists for reactant…
The location of the unique supremum of a stationary process on an interval does not need to be uniformly distributed over that interval. We describe all possible distributions of the supremum location for a broad class of such stationary…
The forest fire model is a reaction-diffusion model where energy, in the form of trees, is injected uniformly, and burned (dissipated) locally. We show that the spatial distribution of fires forms a novel geometric structure where the…
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…
Dynamic mean field theory is applied to the problem of forest fires. The starting point is the Monte Carlo simulation in a lattice of million cells. The statistics of the clusters is obtained by means of the Hoshen--Kopelman algorithm. We…
In sustained growth with random dynamics stationary distributions can exist without detailed balance. This suggests thermodynamical behavior in fast growing complex systems. In order to model such phenomena we apply both a discrete and a…
We investigate the growth of clusters within the forest fire model of R\'{a}th and T\'{o}th [22]. The model is a continuous-time Markov process, similar to the dynamical Erd\H{o}s-R\'{e}nyi random graph but with the addition of so-called…
We propose a discrete-time, finite-state stationary process that can possess long-range dependence. Among the interesting features of this process is that each state can have different long-term dependency, i.e., the indicator sequence can…
Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently extended to hypergraphs. We introduce a variant of…
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…
The meteor process is a model for mass redistribution on a graph. The case of finite graphs was analyzed in \cite{BBPS}. This paper is devoted to the meteor process on ${\mathbb Z}^d$. The process is constructed and a stationary…