Related papers: Gap probabilities and applications to geometry and…
Let $K_n$ be the convex hull of i.i.d. random variables distributed according to the standard normal distribution on $\R^d$. We establish variance asymptotics as $n \to \infty$ for the re-scaled intrinsic volumes and $k$-face functionals of…
Gaussian mixture distributions are commonly employed to represent general probability distributions. Despite the importance of using Gaussian mixtures for uncertainty estimation, the entropy of a Gaussian mixture cannot be calculated…
We consider random Cayley digraphs of order $n$ with uniformly distributed generating set of size $k$. Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as $n\to\infty$ and…
The main results of this article are asymptotic formulas for the variance of the number of zeros of a Gaussian random polynomial of degree $N$ in an open set $U \subset C$ as the degree $N \to \infty$, and more generally for the zeros of…
We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set…
The sequence of 1/2-discrepancy sums of $\{x + i \theta \bmod 1\}$ is realized through a sequence of substitutions on an alphabet of three symbols; particular attention is paid to $x=0$. The first application is to show that any asymptotic…
A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\sum_i g_i A_i$ where $g_i$ are independent…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…
Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…
We study asymptotic infinitesimal distributions of Gaussian Unitary Ensembles with permuted entries. We show that for random uniform permutations, the asymptotically permuted GUE matrix has a null infinitesimal distribution. Moreover, we…
We establish the asymptotic expansion in $\beta$ matrix models with a confining, off-critical potential, in the regime where the support of the equilibrium measure is a union of segments. We first address the case where the filling…
Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational…
The probabilities for gaps in the eigenvalue spectrum of finite $ N\times N $ random unitary ensembles on the unit circle with a singular weight, and the related hermitian ensembles on the line with Cauchy weight, are found exactly. The…
We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…
We consider eigenvalues of a product of n non-Hermitian, independent random matrices. Each matrix in this product is of size N\times N with independent standard complex Gaussian variables. The eigenvalues of such a product form a…
In this work, we study convergence in probability and almost sure convergence for weighted partial sums of random variables that are related to the class of generalized Oppenheim expansions. It is worth noting that the random variables…
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…
Suppose that A_1,\dots, A_N are independent random matrices whose atoms are iid copies of a random variable \xi of mean zero and variance one. It is known from the works of Newman et. al. in the late 80s that when \xi is gaussian then…
Given a hypergraph $\Gamma=(\Omega,\mathcal{X})$ and a sequence $\mathbf{p} = (p_\omega)_{\omega\in \Omega}$ of values in $(0,1)$, let $\Omega_{\mathbf{p}}$ be the random subset of $\Omega$ obtained by keeping every vertex $\omega$…
Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…