相关论文: Fires on trees

This paper extends the study of fringe trees in random plane trees with a given degree statistic. While previous work established the asymptotic normality of the count of fringe trees isomorphic to a fixed tree, we investigate the case…

Forest fires pose a natural threat with devastating social, environmental, and economic implications. The rapid and highly uncertain rate of spread of wildfires necessitates a trustworthy digital tool capable of providing real-time…

The firefighter problem is a monotone dynamic process in graphs that can be viewed as modeling the use of a limited supply of vaccinations to stop the spread of an epidemic. In more detail, a fire spreads through a graph, from burning…

In the present work, the discrete flame model [1] is augmented by introducing the thermal inertia of particles in the preheating zone. The effect of particle thermal inertia on flame speed, propagation limits, and near-limits dynamics of…

Graph burning is one model for the spread of memes and contagion in social networks. The corresponding graph parameter is the burning number of a graph $G$, written $b(G)$, which measures the speed of the social contagion. While it is…

We answer three questions posed by Bubeck and Linial on the limit densities of subtrees in trees. We prove there exist positive $\varepsilon_1$ and $\varepsilon_2$ such that every tree that is neither a path nor a star has inducibility at…

We study the problem of identifying the source of a diffusion spreading over a regular tree. When the degree of each node is at least three, we show that it is possible to construct confidence sets for the diffusion source with size…

Let $G$ be a finite $D$-quasirandom group and $A \subset G^{k}$ a $\delta$-dense subset. Then the density of the set of side lengths $g$ of corners \[ \{(a_{1},\dots,a_{k}),(ga_{1},a_{2},\dots,a_{k}),\dots,(ga_{1},\dots,ga_{k})\} \subset A…

We investigate a graph parameter called the total vertex irregularity strength ($tvs(G)$), i.e. the minimal $s$ such that there is a labeling $w: E(G)\cup V(G)\rightarrow \{1,2,..,s\}$ of the edges and vertices of $G$ giving distinct…

Excitation waves are studied on trees and random networks of coupled active elements. Undamped propagation of such waves is observed in those networks. It represents an excursion from the resting state and a relaxation back to it for each…

We investigate scaling limits of trees built by uniform attachment with freezing, which is a variant of the classical model of random recursive trees introduced in a companion paper. Here vertices are allowed to freeze, and arriving…

In this manuscript we study how the vertex energy of a tree is affected when joined with a bipartite graph. We find an alternating pattern with respect to the coalescence vertex: the energy decreases for vertices located at odd distances…

We study the notion of local treewidth in sparse random graphs: the maximum treewidth over all $k$-vertex subgraphs of an $n$-vertex graph. When $k$ is not too large, we give nearly tight bounds for this local treewidth parameter; we also…

In this paper, we study the weak compactness of the set of conformal metrics in any Riemann surface without boundary whose Calabi energy and area are uniformly bounded. We prove that for any sequence of such metrics, there alwasy exists a…

Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…

The average size of connected vertex subsets of a connected graph generalises a much-studied parameter for subtrees of trees. For trees, the possible values of this parameter are critically affected by the presence or absence of vertices of…

We introduce a model for growing Cayley trees with thermal noise. The evolution of these hierarchical networks reduces to the Eden model and the Invasion Percolation model in the limit $T\to 0$, $T\to \infty$ respectively. We show that the…

Due to their accuracies, methods based on ensembles of regression trees are a popular approach for making predictions. Some common examples include Bayesian additive regression trees, boosting and random forests. This paper focuses on…

Consider the following partial "sorting algorithm" on permutations: take the first entry of the permutation in one-line notation and insert it into the position of its own value. Continue until the first entry is 1. This process imposes a…

We consider a discrete-time dynamical process on graphs, firstly introduced in connection with a protocol for controlling large networks of spin 1/2 quantum mechanical particles [Phys. Rev. Lett. 99, 100501 (2007)]. A description is as…