Related papers: Upper tails for arithmetic progressions in random …
Ramsey theory is a central and active branch of combinatorics. Although Ramsey numbers for graphs have been extensively investigated since Ramsey's work in the 1930s, there is still an exponential gap between the best known lower and upper…
We develop tail estimates for the number of edges in a Chung-Lu random graph with regularly varying weight distribution. Our results show that the most likely way to have an unusually large number of edges is through the presence of one or…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
The analysis of extremal dependence in high dimensions has recently attracted considerable interest. Existing methodology primarily focuses on modeling and estimation of extremal dependence structures, often supported by concentration…
We investigate a way of comparing and classifying tails of random variables. Our approach extends the notion of classical indices, such as exponential and moment indices, which are widely used measuring heaviness of tail functions. A…
Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…
A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…
Non-Hermitean operators may appear during the calculation of a partition function in various models of statistical mechanics. The tail eigen-states, having anomalously small real part of energy $Re(\eps)$, became naturally important in this…
We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\mathbb N$. These graphs…
Given a graph $F$, the random Tur\'an problem asks to determine the maximum number of edges in an $F$-free subgraph of $G_{n,p}$. Prior to this work, the only bipartite graphs $F$ with known tight bounds included certain classes of complete…
We study tails of the supremum of a perturbed random walk under regime which was not yet considered in the literature. Our approach is based on a new renewal theorem, which is of independent interest. We obtain first and second order…
Under K.-T. Sturm's formulation, we obtain a Gaussian upper bound for tail probability of mean value of independent, identically distributed random variables with values in $\mathbb{R}$-trees and Hadamard manifolds.
Correcting for skewness can result in more accurate tail probability approximations in the central limit theorem for sums of independent random variables. In this paper, we extend the theory to sums of local statistics of independent random…
We prove an exponential probability tail inequality for positive semidefinite quadratic forms in a subgaussian random vector. The bound is analogous to one that holds when the vector has independent Gaussian entries.
A well-known longstanding conjecture on the supremum of the tails of normalized sums of independent Rademacher random variables is disproved. A related conjecture, also recently disproved, is discussed.
We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…
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…
In a previous paper with the same title, we gave an upper bound for the exponent of uniform rational approximation to a quadruple of $\mathbb{Q}$-linearly independent real numbers in geometric progression. Here, we explain why this upper…
Empirical distributions have their in-sample maxima as natural censoring. We look at the "hidden tail", that is, the part of the distribution in excess of the maximum for a sample size of $n$. Using extreme value theory, we examine the…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…