Related papers: Ellipsoid fitting up to constant via empirical cov…

It is conjectured by Godsil that the relative number of controllable graphs compared to the total number of simple graphs on n vertices approaches one as n tends to infinity. We prove that this conjecture is true. More generally, our…

Let $x(n):=\alpha n^d \mod 1$ for integer $d >1$ and non-zero real $\alpha$. We show that $\{x(n)\}_{n>0}$ has Poissonian $\ell$-point correlations for almost all choices of $\alpha$ when $d$ is large (depending on $\ell$). This falls in…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

Einsiedler, Mozes, Shah and Shapira [Compos. Math. 152 (2016), 667-692] prove an equidistribution theorem for rational points on expanding horospheres in the space of d-dimensional Euclidean lattices, with d>2. Their proof exploits measure…

Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

Let $A=(a_{ij})$ be an $n\times n$ random matrix with i.i.d. entries such that $\mathbb{E} a_{11} = 0$ and $\mathbb{E} {a_{11}}^2 = 1$. We prove that for any $\delta>0$ there is $L>0$ depending only on $\delta$, and a subset $\mathcal{N}$…

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$…

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph on $n$ vertices is uniquely maximised by…

We prove the tightness of a natural approximation scheme for an analog of the Liouville quantum gravity metric on $\mathbb R^d$ for arbitrary $d\geq 2$. More precisely, let $\{h_n\}_{n\geq 1}$ be a suitable sequence of Gaussian random…

We study a one-dimensional elliptic problem with highly oscillatory random diffusion coefficient. We derive a homogenized solution and a so-called Gaussian corrector. We also prove a "pointwise" large deviation principle (LDP) for the full…

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…

In random sample consensus (RANSAC), the problem of ellipsoid fitting can be formulated as a problem of minimization of point-to-model distance, which is realized by maximizing model score. Hence, the performance of ellipsoid fitting is…

Motivated by recent works on the high-dimensional logistic regression, we establish that the existence of the maximum likelihood estimate exhibits a phase transition for a wide range of generalized linear models with binary outcome and…

We prove that with high probability, a uniform sample of $n$ points in a convex domain in $\mathbb{R}^d$ can be rounded to points on a grid of step size proportional to $1/n^{d+1+\epsilon}$ without changing the underlying chirotope…

The number of faces of the convex hull of $n$ independent and identically distributed random points chosen on the boundary of a smooth convex body in $\mathbb{R}^d$ is investigated. In dimensions two and three the number of $k$-faces is…

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 =…

In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…

We prove the four-dimensional Gaussian random vector maximum conjecture. This conjecture asserts that among all centered Gaussian random vectors $X=(X_1,X_2,X_3,X_4)$ with $E[X_i^2]=1$, $1\le i\le 4$, the expectation…