English
Related papers

Related papers: A Nearly Tight Bound for Fitting an Ellipsoid to G…

200 papers

It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…

Probability · Mathematics 2011-12-22 Martien C. A. van Zuijlen

Let $\varepsilon_1,\ldots,\varepsilon_n$ be independent identically distributed Rademacher random variables, that is $\mathbb{P}\{\varepsilon_i=\pm1\}=1/2$. Let $S_n=a_1\varepsilon_1+\cdots+a_n\varepsilon_n$, where…

Probability · Mathematics 2015-06-02 Vidmantas Kastytis Bentkus , Dainius Dzindzalieta

We prove the large-dimensional Gaussian approximation of a sum of $n$ independent random vectors in $\mathbb{R}^d$ together with fourth-moment error bounds on convex sets and Euclidean balls. We show that compared with classical…

Probability · Mathematics 2021-03-03 Xiao Fang , Yuta Koike

This paper addresses the fundamental question of when convex sets remain disjoint after random projection. We provide an analysis using ideas from high-dimensional convex geometry. For ellipsoids, we provide a bound in terms of the distance…

Machine Learning · Computer Science 2014-04-14 Afonso S. Bandeira , Dustin G. Mixon , Benjamin Recht

The Littlewood Conjecture in Diophantine approximation can be thought of as a problem about covering the plane by a union of hyperbolas centered at rational points. In this paper we consider the problem of translating the center of each…

Number Theory · Mathematics 2016-10-28 Alan Haynes , Henna Koivusalo

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

Probability · Mathematics 2022-01-12 Mathew D. Penrose

Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…

Probability · Mathematics 2013-03-07 Mikko Stenlund

The symmetric convex hull of random points that are independent and distributed according to the cone probability measure on the $\ell_p$-unit sphere of $\mathbb R^n$ for some $1\leq p < \infty$ is considered. We prove that these random…

Functional Analysis · Mathematics 2017-03-14 Julia Hörrmann , Joscha Prochno , Christoph Thaele

This paper derives central limit and bootstrap theorems for probabilities that sums of centered high-dimensional random vectors hit hyperrectangles and sparsely convex sets. Specifically, we derive Gaussian and bootstrap approximations for…

Statistics Theory · Mathematics 2016-03-09 Victor Chernozhukov , Denis Chetverikov , Kengo Kato

Let $X_1,\dots,X_n$ be i.i.d. log-concave random vectors in $\mathbb R^d$ with mean 0 and covariance matrix $\Sigma$. We study the problem of quantifying the normal approximation error for $W=n^{-1/2}\sum_{i=1}^nX_i$ with explicit…

Probability · Mathematics 2023-05-30 Xiao Fang , Yuta Koike

We study the problem of learning general (i.e., not necessarily homogeneous) halfspaces with Random Classification Noise under the Gaussian distribution. We establish nearly-matching algorithmic and Statistical Query (SQ) lower bound…

Machine Learning · Computer Science 2023-07-18 Ilias Diakonikolas , Jelena Diakonikolas , Daniel M. Kane , Puqian Wang , Nikos Zarifis

We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…

Combinatorics · Mathematics 2026-02-19 Kohei Suzuki , Takashi Goda

Given independent normally distributed points A,B,C,D in Euclidean 3-space, let Q denote the plane determined by A,B,C and D^ denote the orthogonal projection of D onto Q. The probability that the tetrahedron ABCD is acute remains…

Probability · Mathematics 2022-03-22 Steven Finch

We show that a random concave function having a periodic hessian on an equilateral lattice has a quadratic scaling limit, if the average hessian of the function satisfies certain conditions. We consider the set of all concave functions $g$…

Probability · Mathematics 2020-04-24 Hariharan Narayanan

We prove an upper bound on the expected $\ell_p$ injective norm of sums of subgaussian random tensors. Our proof is simple and does not rely on any explicit geometric or chaining arguments. Instead, it follows from a simple application of…

Probability · Mathematics 2025-03-14 Ishaq Aden-Ali

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

Functional Analysis · Mathematics 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto

We investigate moment sequences of probability measures on $E\subset\mathbb{R}$ under constraints of certain moments being fixed. This corresponds to studying sections of $n$-th moment spaces, i.e. the spaces of moment sequences of order…

Probability · Mathematics 2022-12-12 Holger Dette , Dominik Tomecki , Martin Venker

We study the small ball probability of an order-$\ell$ simple random tensor $X=X^{(1)}\otimes\cdots\otimes X^{(\ell)}$ where $X^{(i)}, 1\leq i\leq\ell$ are independent random vectors in $\mathbb{R}^n$ that are log-concave or have…

Probability · Mathematics 2024-04-01 Xuehan Hu , Grigoris Paouris

We prove that there is a universal constant $C>0$ so that for every $d \in \mathbb N$, every centered subgaussian distribution $\mathcal D$ on $\mathbb R^d$, and every even $p \in \mathbb N$, the $d$-variate polynomial $(Cp)^{p/2} \cdot…

Data Structures and Algorithms · Computer Science 2024-10-29 Ilias Diakonikolas , Samuel B. Hopkins , Ankit Pensia , Stefan Tiegel

Given a graph $G$ and $p\in [0,1]$, the random subgraph $G_p$ is obtained by retaining each edge of $G$ independently with probability $p$. We show that for every $\epsilon>0$, there exists a constant $C>0$ such that the following holds.…

Combinatorics · Mathematics 2024-07-24 Sahar Diskin , Joshua Erde , Mihyun Kang , Michael Krivelevich