English
Related papers

Related papers: Quantifying minimal non-collinearity among random …

200 papers

Consider linear regression where the examples are generated by an unknown distribution on $R^d\times R$. Without any assumptions on the noise, the linear least squares solution for any i.i.d. sample will typically be biased w.r.t. the least…

Machine Learning · Computer Science 2018-10-08 Michał Dereziński , Manfred K. Warmuth , Daniel Hsu

We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…

Combinatorics · Mathematics 2022-08-09 Miklós Bóna , Boris Pittel

For random $d$-regular graphs on $N$ vertices with $1 \ll d \ll N^{2/3}$, we develop a $d^{-1/2}$ expansion of the local eigenvalue distribution about the Kesten-McKay law up to order $d^{-3}$. This result is valid up to the edge of the…

Probability · Mathematics 2021-07-06 Roland Bauerschmidt , Jiaoyang Huang , Antti Knowles , Horng-Tzer Yau

Consider a $d\times d$ matrix $M$ whose rows are independent centered non-degenerate Gaussian vectors $\xi_1,...,\xi_d$ with covariance matrices $\Sigma_1,...,\Sigma_d$. Denote by $\mathcal{E}_i$ the location-dispersion ellipsoid of…

Probability · Mathematics 2012-06-05 Zakhar Kabluchko , Dmitry Zaporozhets

We introduce a new technique for the study of the distribution of modular symbols, which we apply to congruence subgroups of Bianchi groups. We prove that if $K$ is a quadratic imaginary number field of class number one and $\mathcal{O}_K$…

Number Theory · Mathematics 2020-10-02 Petru Constantinescu

We study the nodal length of random toral Laplace eigenfunctions ("arithmetic random waves") restricted to decreasing domains ("shrinking balls"), all the way down to Planck scale. We find that, up to a natural scaling, for "generic"…

Mathematical Physics · Physics 2021-12-01 Jacques Benatar , Domenico Marinucci , Igor Wigman

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Metric Geometry · Mathematics 2017-07-07 Julian Grote , Elisabeth M. Werner

Given a probability distribution in R^n with general (non-white) covariance, a classical estimator of the covariance matrix is the sample covariance matrix obtained from a sample of N independent points. What is the optimal sample size N =…

Probability · Mathematics 2014-05-21 Roman Vershynin

The ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo and Willsky considers the maximum number $n$ random Gaussian points in $\mathbb{R}^d$, such that with high probability, there exists an origin-symmetric ellipsoid…

Probability · Mathematics 2023-07-25 Madhur Tulsiani , June Wu

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

We study the problem of the nonparametric estimation for the density $\pi$ of the stationary distribution of a $d$-dimensional stochastic differential equation $(X_t)_{t \in [0, T]}$. From the continuous observation of the sampling path on…

Statistics Theory · Mathematics 2023-10-23 Chiara Amorino , Arnaud Gloter

Let $\mathcal{X}$ be a complex projective manifold of dimension $n$ defined over the reals and let $M$ denote its real locus. We study the vanishing locus $Z\_{s\_d}$ in $M$ of a random real holomorphic section $s\_d$ of $\mathcal{E}…

Metric Geometry · Mathematics 2019-12-20 Thomas Letendre

We consider a nonparametric regression setup, where the covariate is a random element in a complete separable metric space, and the parameter of interest associated with the conditional distribution of the response lies in a separable…

Statistics Theory · Mathematics 2018-11-16 Joydeep Chowdhury , Probal Chaudhuri

We show that for an $n\times n$ random matrix $A$ with independent uniformly anti-concentrated entries, such that $\mathbb{E} ||A||^2_{HS}\leq K n^2$, the smallest singular value $\sigma_n(A)$ of $A$ satisfies $$ P\left( \sigma_n(A)\leq…

Probability · Mathematics 2020-10-29 Galyna V. Livshyts , Konstantin Tikhomirov , Roman Vershynin

Approximate a smooth convex body $K$ with nonvanishing curvature by the convex hull of $n$ independent random points sampled from its boundary $\partial K$. In case the points are distributed according to the optimal density, we prove that…

Probability · Mathematics 2025-08-25 Mathias Sonnleitner

We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$, showing that an independent set drawn uniformly at random from such a graph has expected…

Combinatorics · Mathematics 2018-01-25 Ewan Davies , Matthew Jenssen , Will Perkins , Barnaby Roberts

A set of $N$ points is chosen randomly in a $D$-dimensional volume $V=a^D$, with periodic boundary conditions. For each point $i$, its distance $d_i$ is found to its nearest neighbour. Then, the maximal value is found, $d_{max}=max(d_i,…

Computational Physics · Physics 2014-08-26 Malgorzata J. Krawczyk , Janusz Malinowski , Krzysztof Kulakowski

Let $\mathbb{P}_K(n)$ be the probability that $n$ points $z_1,\ldots,z_n$ picked uniformly and independently in $K$, a non-flat compact convex polygon in $\mathbb{R}^2$, are in convex position, that is, form the vertex set of a convex…

Probability · Mathematics 2026-05-19 Ludovic Morin

In linear regression we wish to estimate the optimum linear least squares predictor for a distribution over $d$-dimensional input points and real-valued responses, based on a small sample. Under standard random design analysis, where the…

Machine Learning · Statistics 2022-06-08 Michał Dereziński , Manfred K. Warmuth , Daniel Hsu

We derive a lower bound on the smallest singular value of a random $d$-regular matrix, that is, the adjacency matrix of a random $d$-regular directed graph. More precisely, let $C_1<d< c_1 n/\log^2 n$ and let $\mathcal{M}_{n,d}$ be the set…