Related papers: Planar lattices do not recover from forest fires
We study long-range percolation on the hierarchical lattice of order $N$, where any edge of length $k$ is present with probability $p_k=1-\exp(-\beta^{-k} \alpha)$, independently of all other edges. For fixed $\beta$, we show that the…
This paper focuses on the statistical properties of wild-land fires and, in particular, investigates if spread dynamics relates to simple invasion model. The fractal dimension and lacunarity of three fire scars classified from satellite…
In the polluted modified bootstrap percolation model, sites in the square lattice are independently initially occupied with probability $p$ or closed with probability $q$. A site becomes occupied at a subsequent step if it is not closed and…
Fractal percolation has been introduced by Mandelbrot in 1974. We study the two-dimensional case, with integer subdivision index M and survival probability p. It is well known that there exists a non-trivial critical value p_c(M) such that…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
Directed percolation is one of the generic universality classes for dynamic processes. We study the crossover from isotropic to directed percolation by representing the combined problem as a random cluster model, with a parameter $r$…
In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…
We consider critical site percolation on the triangular lattice in the upper half-plane. Let $u_1, u_2$ be two sites on the boundary and $w$ a site in the interior of the half-plane. It was predicted by Simmons, Kleban and Ziff in a paper…
This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the euclidean separation…
Corner percolation is a dependent bond percolation model on Z^2 introduced by B\'alint T\'oth, in which each vertex has exactly two incident edges, perpendicular to each other. G\'abor Pete has proven in 2008 that under the maximal entropy…
Several results are presented for site percolation on quasi-transitive, planar graphs $G$ with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1,G_2)$ is a matching pair derived from some quasi-transitive…
We consider the Bernoulli percolation model in a finite box and we introduce an automatic control of the percolation probability, which is a function of the percolation configuration. For a suitable choice of this automatic control, the…
We consider simple examples of self-organized critical systems on one-dimensional superlattices without local particle conservation laws. The set of all recurrence states are also found in these examples using a method similar to the…
The Drossel-Schwabl Forest Fire Model is one of the best studied models of non-conservative self-organised criticality. However, using a new algorithm, which allows us to study the model on large statistical and spatial scales, it has been…
We study the finite-time blow-up in two variants of the parabolic-elliptic Keller-Segel system with nonlinear diffusion and logistic source. In $n$-dimensional balls, we consider \begin{align*} \begin{cases} u_t = \nabla \cdot…
We consider a new IDLA - particle system model, on the upper half planar lattice, resulting in an infinite forest covering the half plane. We prove that almost surely all trees are finite.
We investigate a forest-fire model with the density of empty sites as control parameter. The model exhibits three phases, separated by one first-order phase transition and one 'mixed' phase transition which shows critical behavior on only…
In the mean field (or random link) model there are $n$ points and inter-point distances are independent random variables. For $0 < \ell < \infty$ and in the $n \to \infty$ limit, let $\delta(\ell) = 1/n \times$ (maximum number of steps in a…
Discretized landscapes can be mapped onto ranked surfaces, where every element (site or bond) has a unique rank associated with its corresponding relative height. By sequentially allocating these elements according to their ranks and…
We study a percolation problem based on critical loop configurations of the O($n$) loop model on the honeycomb lattice. We define dual clusters as groups of sites on the dual triangular lattice that are not separated by a loop, and…