Related papers: Forests on wired regular trees
It is proved that the restriction of a $k$ and $(k-1)$-component directed spanning forest of minimal weight to an atom of the subset algebra generated by the sets of vertices of trees of $k$-component minimal spanning forests is a tree. For…
The boxicity of a graph G, denoted as box(G) is defined as the minimum integer t such that G is an intersection graph of axis-parallel t-dimensional boxes. A graph G is a k-leaf power if there exists a tree T such that the leaves of the…
We provide the necessary and sufficient conditions for the edge-binomials of the tree forming a $d$-sequence in terms of the degree sequence notion of a graph. We study the regularity of powers of the binomial edge ideals of trees generated…
We perform Monte-Carlo simulations to study the Bernoulli ($p$) bond percolation on the enhanced binary tree which belongs to the class of nonamenable graphs with one end. Our numerical results show that the system has two different…
We present and analyze a model aiming at recovering as dynamical outcomes of tree-grass interactions the wide range of vegetation physiognomies observable in the savanna biome along rainfall gradients at regional/continental scales. The…
In this survey, we explore the connections between two areas of probability: percolation theory and population genetic models. Our first goal is to highlight a construction on Galton-Watson trees, which has been described in two different…
In this paper, we presents novel and sharp bounds on the Albertson index of trees, revealing deep connections between degree sequences and graph irregularity where the Albertson index of Caterpillar tree satisfy \[…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
We consider a Bernoulli bond percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p_n=1-c/\ln n$ for some $c>0$ fixed. It is known that with high probability, there exists then a unique giant cluster of…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
We study the spectrum of adjacency matrices of random graphs. We develop two techniques to lower bound the mass of the continuous part of the spectral measure or the density of states. As an application, we prove that the spectral measure…
Fires and rainfall are major mechanisms that regulate woody and grassy biomasses in savanna ecosystems. Conditions of long-lasting coexistence of trees and grasses have been mainly studied using continuous-time modelling of tree-grass…
This article presents a method for finding the critical probability $p_c$ for the Bernoulli bond percolation on graphs with the so-called tree-like structure. Such a graph can be decomposed into a tree of pieces, each of which has finitely…
This paper defines a notion of binding trees that provide a suitable model for second-order type systems with F-bounded quantifiers and equirecursive types. It defines a notion of regular binding trees that correspond in the right way to…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable. For a random forest $F_n$ sampled uniformly from the set…
Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular…
We study a ferromagnetic Ising model on random graphs with a power-law degree distribution and compute the thermodynamic limit of the pressure when the mean degree is finite (degree exponent $\tau>2$), for which the random graph has a…
This paper studies a class of growing systems of random walks on regular trees, known as \emph{frog models with geometric lifetime} in the literature. With the help of results from renewal theory, we derive new bounds for their critical…
We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…