Related papers: Extremal properties of random trees
Existing theory for multivariate extreme values focuses upon characterizations of the distributional tails when all components of a random vector, standardized to identical margins, grow at the same rate. In this paper, we consider the…
In many areas of interest, modern risk assessment requires estimation of the extremal behaviour of sums of random variables. We derive the first order upper-tail behaviour of the weighted sum of bivariate random variables under weak…
Among many topological indices of trees the sum of distances $\sigma(T)$ and the number of subtrees $F(T)$ have been a long standing pair of graph invariants that are well known for their negative correlation. That is, among various given…
Multivariate extreme value distributions are a common choice for modelling multivariate extremes. In high dimensions, however, the construction of flexible and parsimonious models is challenging. We propose to combine bivariate max-stable…
Motivated by online recommendation systems, we study a family of random forests. The vertices of the forest are labeled by integers. Each non-positive integer $i\le 0$ is the root of a tree. Vertices labeled by positive integers $n \ge 1$…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…
It is well known that the distribution of extreme values of strictly stationary sequences differ from those of independent and identically distributed sequences in that extremal clustering may occur. Here we consider non-stationary but…
We study numerically the maximal and minimal height distributions (MAHD, MIHD) of the nonlinear interface growth equations of second and fourth order and of related lattice models in two dimensions. MAHD and MIHD are different due to the…
We consider the extremal properties of the highly flexible univariate extended skew-normal distribution. We derive the well-known Mills' inequalities and Mills' ratio for the extended skew-normal distribution and establish the asymptotic…
We study that over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees. Trees minimizing (resp. maximizing) the total number of subtrees usually maximize (resp. minimize) the…
The scaling properties of the maximal height of a growing self-affine surface with a lateral extent $L$ are considered. In the late-time regime its value measured relative to the evolving average height scales like the roughness: $h^{*}_{L}…
In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…
The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…
We identify the mean growth of the independence number of random binary search trees and random recursive trees and show normal fluctuations around their means. Similarly we also show normal limit laws for the domination number and…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.
We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
We consider maximum rooted tree extension counts in random graphs, i.e., we consider M_n = \max_v X_v where X_v counts the number of copies of a given tree in G_{n,p} rooted at vertex v. We determine the asymptotics of M_n when the random…
We show that the expected size of the maximum agreement subtree of two $n$-leaf trees, uniformly random among all trees with the shape, is $\Theta(\sqrt{n})$. To derive the lower bound, we prove a global structural result on a decomposition…