Related papers: Local tail bounds for polynomials on the discrete …

We derive novel guaranteed lower bounds for eigenvalues of the Euler-Bernoulli beam with variable bending stiffness. While the standard finite element Rayleigh-Ritz method automatically yields upper bounds, we obtain lower bounds by…

We study deviation of U-statistics when samples have heavy-tailed distribution so the kernel of the U-statistic does not have bounded exponential moments at any positive point. We obtain an exponential upper bound for the tail of the…

The aim of this work is to extend the results from [B2] on local eigenvalue spacings to certain 1D lattice Schrodinger with a Bernoulli potential. We assume the disorder satisfies a certain algebraic condition that enables one to invoke the…

We demonstrate that the probability density of a quantum state moving freely in one dimension may decay faster than 1/t. Inverse quadratic and cubic dependences are illustrated with analytically solvable examples. Decays faster than 1/t…

This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices. These results place simple and easily verifiable hypotheses on the summands, and they deliver strong conclusions about the…

If $\mu$ is a distribution over the $d$-dimensional Boolean cube $\{0,1\}^d$, our goal is to estimate its mean $p\in[0,1]^d$ based on $n$ iid draws from $\mu$. Specifically, we consider the empirical mean estimator $\hat p_n$ and study the…

We show on complete metric spaces a polynomial tail decay for stationary measures of contracting on average generating measures.

We study the tail behavior for the maximum of discrete Gaussian free field on a 2D box with Dirichlet boundary condition after centering by its expectation. We show that it exhibits an exponential decay for the right tail and a double…

If E is a locally convex topological vector space, let P(E) be the pre-ordered set of all continuous seminorms on E. We study, on the one hand, for g an infinite cardinal those locally convex spaces E which have the g-neighbourhood property…

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

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…

We prove that the random variable $\ct=\argmax_{t\in\rr}\{\aip(t)-t^2\}$ has tails which decay like $e^{-ct^3}$. The distribution of $\ct$ is a universal distribution which governs the rescaled endpoint of directed polymers in 1+1…

In this article, we consider two models of directed polymers in random environment: a discrete model and a continuous model. We consider these models in dimension greater or equal to 3 and we suppose that the normalized partition function…

In the setup of i.i.d.~observations and a real valued differentiable functional~$T$, locally asymptotic upper bounds are derived for the power of one-sided tests (simple, versus large values of~$T$)and for the confidence probability of…

We show that if $\partial\mathcal{R}$ is the boundary of the range of super-Brownian motion and dim denotes Hausdorff dimension, then with probability one, for any open set $U$, $\partial\mathcal{R}\cap U\neq\emptyset$ implies…

If a probability density p(\x) (\x\in\R^k) is bounded and R(t) := \int \exp(t\ell(\x)) \d\x < \infty for some linear functional \ell and all t\in(0,1), then, for each t\in(0,1) and all large enough n, the n-fold convolution of the t-tilted…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…

In this paper, we investigate an upper bound of the polar derivative of a polynomial of degree $n$ $$p(z)=(z-z_m)^{t_m} (z-z_{m-1})^{t_{m-1}}\cdots (z-z_0)^{t_0}(a_0+\sum\limits_{\nu=\mu} ^{n-(t_m+\cdots+t_0)} a_{\nu}z^\nu)$$ where zeros…