Related papers: Distances between Random Orthogonal Matrices and I…

Motivated by problems in controlled experiments, we study the discrepancy of random matrices with continuous entries where the number of columns $n$ is much larger than the number of rows $m$. Our first result shows that if $\omega(1) = m =…

Euclidean distance matrices (EDM) are symmetric nonnegative matrices with several interesting properties. In this article, we introduce a wider class of matrices called generalized Euclidean distance matrices (GDMs) that include EDMs. Each…

Given samples from an unknown distribution $p$ and a description of a distribution $q$, are $p$ and $q$ close or far? This question of "identity testing" has received significant attention in the case of testing whether $p$ and $q$ are…

Let G: C^n \times C^n -> C, G((x_1,...,x_n),(y_1,...,y_n))=(x_1-y_1)^2+...+ (x_n-y_n)^2. We say that f: R^n -> C^n preserves distance d>0 if for each x,y \in R^n G(x,y)=d^2 implies G(f(x),f(y))=d^2. Let A(n) denote the set of all positive…

Consider $n$ points $x_1,\ldots,x_n$ in finite-dimensional euclidean space, each having one of two colors. Suppose there exists a separating hyperplane (identified with its unit normal vector $w)$ for the points, i.e a hyperplane such that…

We consider $n\times n$ Hermitian matrices with i.i.d. entries $X_{ij}$ whose tail probabilities $\mathbb {P}(|X_{ij}|\geq t)$ behave like $e^{-at^{\alpha}}$ for some $a>0$ and $\alpha \in(0,2)$. We establish a large deviation principle for…

The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…

We study the gaps between consecutive singular values of random rectangular matrices. Specifically, if $M$ is an $n \times p$ random matrix with independent and identically distributed entries and $\Sigma$ is a $n \times n$ deterministic…

We propose that quantum physics is the continuous approximation of a more fundamental, discrete graph theory (theory X). Accordingly, the Euclidean transition amplitude Z provides a partition function for geometries over the graph, which is…

In Micchelli's paper "Interpolation of scattered data: distance matrices and conditionally positive functions", deep results were obtained concerning the invertibility of matrices arising from radial basis function interpolation. In…

Let $(g_{n})_{n\geq 1}$ be a sequence of independent identically distributed $d\times d$ real random matrices with Lyapunov exponent $\gamma$. For any starting point $x$ on the unit sphere in $\mathbb R^d$, we deal with the norm $ | G_n x |…

Let $X$ be a symmetric random matrix with independent but non-identically distributed centered Gaussian entries. We show that $$ \mathbf{E}\|X\|_{S_p} \asymp \mathbf{E}\Bigg[ \Bigg(\sum_i\Bigg(\sum_j X_{ij}^2\Bigg)^{p/2}\Bigg)^{1/p} \Bigg]…

We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…

We give bounds for the total variation distance between the solutions to two stochastic differential equations starting at the same point and with close coefficients, which applies in particular to the distance between an exact solution and…

We prove that there exists a constant $\gamma_{\mathrm{crit}}\approx .17566$ such that if $G\sim \mathbb{G}(n,1/2)$ then for any $\varepsilon > 0$ with high probability $G$ has a equipartition such that each vertex has…

In the past 20 years, the study of real eigenvalues of non-symmetric real random matrices has seen important progress. Notwithstanding, central questions still remain open, such as the characterization of their asymptotic statistics and the…

Recently we considered a class of random matrices obtained by choosing distinct codewords at random from linear codes over finite fields and proved that under some natural algebraic conditions their empirical spectral distribution converges…

We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…

We study the fluctuations of eigenvalues from a class of Wigner random matrices that generalize the Gaussian orthogonal ensemble. We begin by considering an $n \times n$ matrix from the Gaussian orthogonal ensemble (GOE) or Gaussian…

Let $A \in \mathbb{R}^{N \times n}$ ($N \geq n$) be a random matrix with with independent entries that have mean 0 variance 1 and bounded $2+\beta$ moment. We show that the smallest singular value $\sigma_n(A)$ satisfies \[ \Pr…