Related papers: On lower bounds for hypergeometric tails

In general, obtaining the exact steady-state distribution of queue lengths is not feasible. Therefore, we establish bounds for the tail probabilities of queue lengths. Specifically, we examine queueing systems under Heavy-Traffic (HT)…

The extreme value dependence of regularly varying stationary time series can be described by the spectral tail process. Drees, Segers and Warchol [Extremes 18(3): 369--402, 2015] proposed estimators of the marginal distributions of this…

In this paper non-asymptotic exponential estimates are derived for the tail distribution of polynomial martingale differences in terms unconditional tails distributions of summands. Applications are considered in the theory of polynomials…

For a given random sequence $(C,T_{1},T_{2},\ldots)$ with nonzero $C$ and a.s. finite number of nonzero $T_{k}$, the nonhomogeneous smoothing transform $\mathcal{S}$ maps the law of a real random variable $X$ to the law of $\sum_{k\ge…

Let $\{X_i\}_{i\geq1}$ be an i.i.d. sequence of random variables and define, for $n\geq2$, \[T_n=\cases{n^{-1/2}\hat{\sigma}_n^{-1}S_n,\quad \hat{\sigma}_n>0,\cr 0,\quad \hat{\sigma}_n=0,}with S_n=\sum_{i=1}^nX_i,…

The $r$-color size-Ramsey number of a $k$-uniform hypergraph $H$, denoted by $\hat{R}_r(H)$, is the minimum number of edges in a $k$-uniform hypergraph $G$ such that for every $r$-coloring of the edges of $G$ there exists a monochromatic…

Fix a sequence c=(c_1,...,c_n) of non-negative integers with sum n-1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v_1,...,v_n so that for each 1 <= i <= n, v_i has exactly c_i children. Let T be…

We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…

It is known that $N(n)$, the maximum number of mutually orthogonal latin squares of order $n$, satisfies the lower bound $N(n) \ge n^{1/14.8}$ for large $n$. For $h\ge 2$, relatively little is known about the quantity $N(h^n)$, which…

We use a simple method to derive two concentration bounds on the hypergeometric distribution. Comparison with existing results illustrates the advantage of these bounds across different regimes.

The planar Tur\'an number of a graph $H$, denoted by $ex_{_\mathcal{P}}(n,H)$, is the largest number of edges in a planar graph on $n $ vertices without containing $H$ as a subgraph. In this paper, we continue to study the topic of…

We consider $N\times N$ non-Hermitian random matrices of the form $X+A$, where $A$ is a general deterministic matrix and $\sqrt{N}X$ consists of independent entries with zero mean, unit variance, and bounded densities. For this ensemble, we…

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

Given a connected graph $G$ and its vertex $x$, let $U_x(G)$ denote the universal cover of $G$ obtained by unfolding $G$ into a tree starting from $x$. Let $T=T(n)$ be the minimum number such that, for graphs $G$ and $H$ with at most $n$…

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

The authors announce a general tail estimate, called a decoupling inequality, for a symmetrized sum of non-linear $k$-correlations of $n>k$ independent random variables.

Let $r,k,\ell$ be integers such that $0\le\ell\le\binom{k}{r}$. Given a large $r$-uniform hypergraph $G$, we consider the fraction of $k$-vertex subsets which span exactly $\ell$ edges. If $\ell$ is 0 or $\binom{k}{r}$, this fraction can be…

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

The size-Ramsey number $R^{(k)}(H)$ of a $k$-uniform hypergraph $H$ is the minimum number of edges in a $k$-uniform hypergraph $G$ with the property that every `$2$-edge coloring' of $G$ contains a monochromatic copy of $H$. For $k\ge2$ and…

In this paper we show under weak assumptions that for $R\stackrel{d}{=}1+M_1+M_1M_2+\ldots$, where $P(M\in[0,1])=1$ and $M_i$ are independent copies of $M$, we have $\ln P(R>x)\sim C\, x\ln P(M>1-\frac1x)$ as $x\to\infty$. The constant $C$…