Related papers: The average singular value of a complex random mat…

Finite free convolutions, $\boxplus_d$ and $\boxtimes_d$, are binary operations on polynomials of degree $d$ that are central to finite free probability, a developing field at the intersection of free probability and the geometry of…

Consider the empirical spectral distribution of complex random $n\times n$ matrix whose entries are independent and identically distributed random variables with mean zero and variance $1/n$. In this paper, via applying potential theory in…

Let $Q_n$ be a random $n\times n$ matrix with entries in $\{0,1\}$ whose rows are independent vectors of exactly $n/2$ zero components. We show that the smallest singular value $s_n(Q_n)$ of $Q_n$ satisfies \[ \mathbb{P}\Big\{s_n(Q_n)\le…

Let a random simplex in a d-dimensional convex body be the convex hull of d+1 random points from the body. We study the following question: As a function of the convex body, is the expected volume of a random simplex monotone non-decreasing…

Let $A$ be a matrix whose columns $X_1,\dots, X_N$ are independent random vectors in $\mathbb{R}^n$. Assume that the tails of the 1-dimensional marginals decay as $\mathbb{P}(|\langle X_i, a\rangle|\geq t)\leq t^{-p}$ uniformly in $a\in…

We obtain the limiting spectral distribution for large sample covariance matrices associated with random vectors having graph-dependent entries under the assumption that the interdependence among the entries grows with the sample size n.…

Products of shifted characteristic polynomials, and ratios of such products, averaged over the classical compact groups are of great interest to number theorists as they model similar averages of L-functions in families with the same…

We study the characteristic polynomial of Haar distributed random unitary matrices. We show that after a suitable normalization, as one increases the size of the matrix, powers of the absolute value of the characteristic polynomial as well…

We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…

We study invariant random matrix ensembles \begin{equation*} \mathbb{P}_n(d M)=Z_n^{-1}\exp(-n\,tr(V(M)))\,d M \end{equation*} defined on complex Hermitian matrices $M$ of size $n\times n$, where $V$ is real analytic such that the…

Relying on random matrix theory (RMT), this paper studies asymmetric order-$d$ spiked tensor models with Gaussian noise. Using the variational definition of the singular vectors and values of (Lim, 2005), we show that the analysis of the…

We equip the polytope of $n\times n$ Markov matrices with the normalized trace of the Lebesgue measure of $\mathbb{R}^{n^2}$. This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of…

The large time, small mass, asymptotic behavior of the average mass distribution $\pb$ is studied in a $d$-dimensional system of diffusing aggregating particles for $1\leq d \leq 2$. By means of both a renormalization group computation as…

Computing the first few singular vectors of a large matrix is a problem that frequently comes up in statistics and numerical analysis. Given the presence of noise, exact calculation is hard to achieve, and the following problem is of…

We discuss in some detail the general problem of computing averages of convergent Euler products, and apply this to examples arising from singular series for the $k$-tuple conjecture and more general problems of polynomial representation of…

Inspired by the idea of Bernoulli decomposition, we give a simple proof for a generalization of Hal\'asz anti--concentration result about random sum of vectores in $\mathbb{R}^d$. From our results, we can give one upper bound for the…

Consider an $N$ by $N$ matrix $X$ of complex entries with iid real and imaginary parts. We show that the local density of eigenvalues of $X^*X$ converges to the Marchenko-Pastur law on the optimal scale with probability $1$. We also obtain…

Metric regularity is among the central concepts of nonlinear and variational analysis, constrained optimization, and their numerous applications. However, metric regularity can be elusive for some important ill-posed classes of problems…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We study random partitions $\lambda=(\lambda_1,\lambda_2,...,\lambda_d)$ of $n$ whose length is not bigger than a fixed number $d$. Suppose a random partition $\lambda$ is distributed according to the Jack measure, which is a deformation of…