相关论文: Fires on trees

Graph burning models the spread of information or contagion in a graph. At each time step, two events occur: neighbours of already burned vertices become burned, and a new vertex is chosen to be burned. The big conjecture is known as the…

We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…

In tropical regions, fires propagate readily in grasslands but typically consume only edges of forest patches. Thus forest patches grow due to tree propagation and shrink by fires in surrounding grasslands. The interplay between these…

We consider a family of discrete coagulation-fragmentation equations closely related to the one-dimensional forest-fire model of statistical mechanics: each pair of particles with masses $i,j \in \nn$ merge together at rate 2 to produce a…

In this article, we study Hartnell's Firefighter Problem through the group theoretic notions of growth and quasi-isometry. A graph has the $n$-containment property if for every finite initial fire, there is a strategy to contain the fire by…

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…

When a thin elastic sheet is confined to a region much smaller than its size the morphology of the resulting crumpled membrane is a network of straight ridges or folds that meet at sharp vertices. A virial theorem predicts the ratio of the…

A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…

The Burning Number Conjecture, that a graph on $n$ vertices can be burned in at most $\lceil \sqrt{n} \ \rceil$ rounds, has been of central interest for the past several years. Much of the literature toward its resolution focuses on two…

The behavior of velocity fluctuations near a wall has long fascinated the turbulence community, because the prevalent theoretical framework of an attached-eddy hierarchy appears to predict infinite intensities as the Reynolds number tends…

Chernyshev, Rauch, and Rautenbach proved that every connected graph on $n$ vertices with less than $\frac{11}{5}n-\frac{18}{5}$ edges has a vertex cut that induces a forest, and conjectured that the same remains true if the graph has less…

Call a percolation process on edges of a graph change intolerant if the status of each edge is almost surely determined by the status of the other edges. We give necessary and sufficient conditions for change intolerance of the wired…

Cayley's formula states that the number of labelled trees on $n$ vertices is $n^{n-2}$, and many of the current proofs involve complex structures or rigorous computation. We present a bijective proof of the formula by providing an…

We propose a new procedure for testing whether two networks are edge-correlated through some latent vertex correspondence. The test statistic is based on counting the co-occurrences of signed trees for a family of non-isomorphic trees. When…

We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…

The renormalization ideas of self-similar dynamics of a strongly turbulent flame front are applied to the case of a flame with realistically large thermal expansion of the burning matter. In that case a flame front is corrugated both by…

We consider linear preferential attachment random trees with additive fitness, where fitness is defined as the random initial vertex attractiveness. We show that when the fitness distribution has positive bounded support, the weak local…

There are few exactly solvable lattice models and even fewer solvable quantum lattice models. Here we address the problem of finding the spectrum of the tight-binding model (equivalently, the spectrum of the adjacency matrix) on Cayley…

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…

We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…