English
Related papers

Related papers: Inequalities and tail bounds for elementary symmet…

200 papers

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…

Probability · Mathematics 2019-04-05 Xiao Fang , Li Luo , Qi-Man Shao

We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a…

Machine Learning · Computer Science 2015-11-10 Francis Bach

Recently, the concept of tail dependence has been discussed in financial applications related to market or credit risk. The multivariate extreme value theory is a proper tool to measure and model dependence, for example, of large loss…

Applications · Statistics 2011-09-27 Marta Ferreira

We derive the exponential as well as power decreasing tail estimations for normed sums of centered independent identical distributed (or not) random variables on the Khintchine's form. We consider arbitrary, in particular, non-Rademacher's…

Probability · Mathematics 2021-10-06 M. R. Formica , E. Ostrovsky , L. Sirota

We present an encoding of a polynomial system into vanishing and non-vanishing constraints on almost-principal minors of a symmetric, principally regular matrix, such that the solvability of the system over some field is equivalent to the…

Statistics Theory · Mathematics 2021-03-04 Tobias Boege

The current work applies some recent combinatorial tools due to Jain to control the eigenvalue gaps of a matrix $M_n = M + N_n$ where $M$ is deterministic, symmetric with large operator norm and $N_n$ is a random symmetric matrix with…

Probability · Mathematics 2022-11-02 Kyle Luh , Ryan Vogel , Alan Yu

Consider a random sample in the max-domain of attraction of a multivariate extreme value distribution such that the dependence structure of the attractor belongs to a parametric model. A new estimator for the unknown parameter is defined as…

Statistics Theory · Mathematics 2012-10-05 John H. J. Einmahl , Andrea Krajina , Johan Segers

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

We prove bounds on statistical distances between high-dimensional exchangeable mixture distributions (which we call \emph{permutation mixtures}) and their i.i.d. counterparts. Our results are based on a novel method for controlling $\chi^2$…

Statistics Theory · Mathematics 2025-09-17 Yanjun Han , Jonathan Niles-Weed

Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…

Numerical Analysis · Mathematics 2020-12-01 Markus Hegland , Frank deHoog

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

Probability · Mathematics 2024-04-08 Marcus Michelen , Sean O'Rourke

We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.

Probability · Mathematics 2016-04-22 Christos Pelekis , Jan Ramon

We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…

Combinatorics · Mathematics 2022-09-23 Leonid Gurvits , Jonathan Leake

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov

Hayes equivalence is defined on monic polynomials over a finite field $\fq$ in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial $Q$. We study the distribution of the number of zeros in a…

Combinatorics · Mathematics 2024-01-09 Zhicheng Gao

We show bounds on tail probabilities for quadratic forms in sub-gaussian non-necessarily independent random variables. Our main tool will be estimates of the Luxemburg norms of such forms. This will allow us to formulate the above-mentioned…

Probability · Mathematics 2020-08-14 Krzysztof Zajkowski

A seminal result of Nisan and Szegedy (STOC, 1992) shows that for any total Boolean function, the degree of the real polynomial that computes the function, and the minimal degree of a real polynomial that point-wise approximates the…

Computational Complexity · Computer Science 2025-07-21 Arkadev Chattopadhyay , Yogesh Dahiya , Shachar Lovett

Let $X_N$ be an $N\ts N$ random symmetric matrix with independent equidistributed entries. If the law $P$ of the entries has a finite second moment, it was shown by Wigner \cite{wigner} that the empirical distribution of the eigenvalues of…

Probability · Mathematics 2007-07-17 Gerard Ben Arous , Alice Guionnet

Given a polynomial $f$ defined over a number field $K$, we make effective certain special cases of a conjecture of S. Ih, on the finiteness of $f$-preperiodic points which are $S$-integral with respect to a fixed non-preperiodic point…

Number Theory · Mathematics 2022-06-30 Marley Young

We study generalisations of a simple, combinatorial proof of a Chernoff bound similar to the one by Impagliazzo and Kabanets (RANDOM, 2010). In particular, we prove a randomized version of the hitting property of expander random walks and…

Discrete Mathematics · Computer Science 2015-01-16 Jan Hązła , Thomas Holenstein
‹ Prev 1 8 9 10 Next ›