相关论文: Tail bounds for the height and width of a random t…

The rank (also known as protection number or leaf-height) of a vertex in a rooted tree is the minimum distance between the vertex and any of its leaf descendants. We consider the sum of ranks over all vertices (known as the security) in…

Let $\T_{n}$ be the set of rooted labeled trees on $\set{0,...,n}$. A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new…

This study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to…

The Tracy-Widom beta distribution is the large dimensional limit of the top eigenvalue of beta random matrix ensembles. We use the stochastic Airy operator representation to show that as a tends to infinity the tail of the Tracy Widom…

Exponential tail bounds for sums play an important role in statistics, but the example of the $t$-statistic shows that the exponential tail decay may be lost when population parameters need to be estimated from the data. However, it turns…

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…

We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…

We study in this report the so-called Strictly Subgaussian (SSub) random variables (r.v.), which form a very interest subclass of Subgaussian (Sub) r.v., and obtain the exact exponential bounds for tail of distribution for sums of…

In a balloon drawing of a tree, all the children under the same parent are placed on the circumference of the circle centered at their parent, and the radius of the circle centered at each node along any path from the root reflects the…

We prove that several natural graph classes have tree-decompositions with minimum width such that each bag has bounded treewidth. For example, every planar graph has a tree-decomposition with minimum width such that each bag has treewidth…

One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough…

In this paper, we study how to draw trees so that they are planar, straight-line and respect a given order of edges around each node. We focus on minimizing the height, and show that we can always achieve a height of at most 2pw(T)+1, where…

We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size.…

We show that every graph with pathwidth strictly less than $a$ that contains no path on $2^b$ vertices as a subgraph has treedepth at most $10ab$. The bound is best possible up to a constant factor.

We study the distribution of a fully connected neural network with random Gaussian weights and biases in which the hidden layer widths are proportional to a large constant $n$. Under mild assumptions on the non-linearity, we obtain…

We investigate how small the Randi\'c index of a graph can be in terms of its matching number, and prove several results. We give best-possible linear bounds for graphs of small excess and for subcubic graphs; in the former case the size of…

For a simple finite connected graph $G$, let $diam(G)$ and $d_{G}(u,v)$ denote the diameter of $G$ and distance between $u$ and $v$ in $G$, respectively. A radio labeling of a graph $G$ is a mapping $f$ : $V(G) \rightarrow \{0, 1, 2,...\}$…

We estimate the growth rate of the function which counts the number of torsion points of order at most $T$ on an algebraic subvariety of the algebraic torus $\mathbb G_m^n$ over some algebraically closed field. We prove a general upper…

In this paper we study binary trees with choosable edge lengths, in particular rooted binary trees with the property that the two edges leading from every non-leaf to its two children are assigned integral lengths $l_1$ and $l_2$ with…

We investigate extremal statistical properties such as the maximal and the minimal heights of randomly generated binary trees. By analyzing the master evolution equations we show that the cumulative distribution of extremal heights…