相关论文: Tail and moment estimates for chaoses generated by…

We construct a new tail bound for the sum of independent random variables for situations in which the expected value of the sum is known and each random variable lies within a specified interval, which may be different for each variable.…

Let $A$ be an $N\times n$ random matrix whose entries are coordinates of an isotropic log-concave random vector in $\mathbb{R}^{Nn}$. We prove sharp lower tail estimates for the smallest singular value of $A$ in the following cases: (1)…

This paper investigates the asymptotics of the number of prime values taken by a polynomial in several variables with integer coefficients. Based on probabilistic heuristics and the multidimensional Bateman Horn conjecture, the expected…

We study discrete statistical mechanics systems perturbed by a random environment without a finite second moment. Specifically, we consider a random environment whose tail distribution satisfies $P[\omega > x] \sim x^{-\gamma}$ as $x \to…

General upper tail estimates are given for counting edges in a random induced subhypergraph of a fixed hypergraph H, with an easy proof by estimating the moments. As an application we consider the numbers of arithmetic progressions and…

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…

We discuss the quenched tail estimates for the random walk in random scenery. The random walk is the symmetric nearest neighbor walk and the random scenery is assumed to be independent and identically distributed, non-negative, and has a…

Here we suppose that the observed random variable has cumulative distribution function $F$ with regularly varying tail, i.e. $1-F \in RV_{-\alpha}$, $\alpha > 0$. Using the results about exponential order statistics we investigate…

We obtain Rosenthal-type inequalities with sharp constants for moments of sums of independent random variables which are mixtures of a fixed distribution. We also identify extremisers in log-concave settings when the moments of summands are…

We prove exponential moments for linear combinations of the number of individuals of each type of a whole multitype Poissonian Galton Watson process. We give sharp estimates for such quantities, which depend on the expectation of the…

We present a flexible, deterministic numerical method for computing left-tail rare events of sums of non-negative, independent random variables. The method is based on iterative numerical integration of linear convolutions by means of…

We obtain in this paper a non-asymptotic non-improvable up to multiplicative constant moment and exponential tail estimates for distribution for U-statistics by means of martingale representation. We show also the exactness of obtained…

We show that high-accuracy guarantees for log-concave sampling -- that is, iteration and query complexities which scale as $\mathrm{poly}\log(1/\delta)$, where $\delta$ is the desired target accuracy -- are achievable using stochastic…

In this paper we consider the semi-parametric estimation of extreme quantiles of a right heavy-tail model. We propose a new Log Probability Weighted Moment estimator for extreme quantiles, which is obtained from the estimators of the shape…

We establish two-sided bounds for expectations of order statistics ($k$-th maxima) of moduli of coordinates of centered log-concave random vectors with uncorrelated coordinates. Our bounds are exact up to multiplicative universal constants…

The risk of catastrophes is related to the possibility of occurring extreme values. Several statistical methodologies have been developed in order to evaluate the propensity of a process for the occurrence of high values and the permanence…

We prove that multiplicative chaos measures can be constructed from extreme level sets or thick points of the underlying logarithmically correlated field. We develop a method which covers the whole subcritical phase and only requires…

Polynomial chaos expansion is a popular way to develop surrogate models for stochastic systems with arbitrary random variables. Standard techniques such as Galerkin projection, stochastic collocation, and least squares approximation, are…

We study efficient differentially private algorithms for estimating monotone statistics, i.e., statistics that are monotone under the addition of new observations. The starting point for our investigation is subsample-and-aggregate: a…

For spatiotemporal chaos described by partial differential equations, there are generally locations where the dynamical variable achieves its local extremum or where the time partial derivative of the variable vanishes instantaneously. To a…