Related papers: Tail bounds for the height and width of a random t…
We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the…
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…
Let G = (V,E) be a finite, simple and undirected graph. For $S \subseteq V$, let $\delta(S,G) = \{(u,v) \in E : u \in S \mbox {and} v \in V-S \}$ be the edge boundary of $S$. Given an integer $i$, $1 \leq i \leq | V |$, let the edge…
We re-examine a lower-tail upper bound for the random variable $$X=\prod_{i=1}^{\infty}\min\left\{\sum_{k=1}^iE_k,1\right\},$$ where $E_1,E_2,\ldots\stackrel{iid}\sim\text{Exp}(1)$. This bound has found use in root-finding and seed-finding…
We establish an upper bound on the tails of a random variable that arises as a solution of a stochastic difference equation. In the non--negative case our bound is similar to a lower bound obtained by Goldie and Gr\"ubel in 1996.
This work proves new probability bounds relating to the height, width, and size of Galton-Watson trees. For example, if $T$ is any Galton-Watson tree, and $H$, $W$, and $|T|$ are the height, width, and size of $T$, respectively, then $H/W$…
Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…
We establish uniform sub-exponential tail bounds for the width, height and maximal outdegree of critical Bienaym\'e-Galton-Watson trees conditioned on having a large fixed size, whose offspring distribution belongs to the domain of…
The exact expression for the probability density $p_{_N}(x)$ for sums of a finite number $N$ of random independent terms is obtained. It is shown that the very tail of $p_{_N}(x)$ has a Gaussian form if and only if all the random terms are…
Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support…
We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree…
We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results…
We significantly improve the generalization bounds for VC classes by using two main ideas. First, we consider the hypergeometric tail inversion to obtain a very tight non-uniform distribution-independent risk upper bound for VC classes.…
We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…
We propose a variational tail bound for norms of random vectors under moment assumptions on their one-dimensional marginals. A simplified version of the bound that parametrizes the ``aggregating distribution'' using a certain pushforward of…
An identifying code of a closed-twin-free graph $G$ is a dominating set $S$ of vertices of $G$ such that any two vertices in $G$ have a distinct intersection between their closed neighborhoods and $S$. It was conjectured that there exists…
A set $S\subseteq V$ of vertices of a graph $G$ is a $c$-clustered set if it induces a subgraph with components of order at most $c$ each, and $\alpha_c(G)$ denotes the size of a largest $c$-clustered set. For any graph $G$ on $n$ vertices…
We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three…
The tree-depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree-depth of random graphs. For dense graphs, p>> 1/n, the tree-depth of a random graph G is a.a.s.…
An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\Psi(G)$. In this paper, an algorithm to count…