Related papers: Large gaps between random eigenvalues

We study the $k$-largest eigenvalues of heavy-tailed sample covariance matrices of the form $\bX\bX^\T$ in an asymptotic framework, where the dimension of the data and the sample size tend to infinity. To this end, we assume that the rows…

We compute spectra of sample auto-covariance matrices of second order stationary stochastic processes. We look at a limit in which both the matrix dimension $N$ and the sample size $M$ used to define empirical averages diverge, with their…

We deal with a planar random flight $\{(X(t),Y(t)),0<t\leq T\}$ observed at $n+1$ equidistant times $t_i=i\Delta_n,i=0,1,...,n$. The aim of this paper is to estimate the unknown value of the parameter $\lambda$, the underlying rate of the…

We establish large deviation formulas for linear statistics on the $N$ transmission eigenvalues $\{T_i\}$ of a chaotic cavity, in the framework of Random Matrix Theory. Given any linear statistics of interest $A=\sum_{i=1}^N a(T_i)$, the…

Let $\lambda$ be the second largest eigenvalue in absolute value of a uniform random $d$-regular graph on $n$ vertices. It was famously conjectured by Alon and proved by Friedman that if $d$ is fixed independent of $n$, then…

The study of discrete-time stochastic processes on the half-line with mean drift at $x$ given by $\mu_1 (x) \to 0$ as $x \to \infty$ is known as Lamperti's problem. We give sharp almost-sure bounds for processes of this type in the case…

The local eigenvalue statistics of large random matrices near a hard edge transitioning into a soft edge are described by the Bessel process associated with a large parameter $\alpha$. For this point process, we obtain 1) exponential moment…

This paper provides a precise error analysis for the maximum likelihood estimate $\hat{a}_{\text{ML}}(u_1^n)$ of the parameter $a$ given samples $u_1^n = (u_1, \ldots, u_n)'$ drawn from a nonstationary Gauss-Markov process $U_i = a U_{i-1}…

The Cram\'er-Rao bound serves as a crucial lower limit for the mean squared error of an estimator in frequentist parameter estimation. Paradoxically, it requires highly accurate prior knowledge of the estimated parameter for constructing…

Consider the sample covariance matrix $$\Sigma^{1/2}XX^T\Sigma^{1/2}$$ where $X$ is an $M\times N$ random matrix with independent entries and $\Sigma$ is an $M\times M$ diagonal matrix. It is known that if $\Sigma$ is deterministic, then…

Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $\mathcal{P}_N(K,\lambda)$ that a large $N \times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a…

Bell's theorem rests on the following fundamental condition for a local system: P(a,b|alpha, beta, lambda)= P(a|alpha, lambda)P(b|beta, lambda). Here a and b are the outcomes respectively for measurements alpha on one side, and beta on the…

We study $n\times n$ random Hermitian matrix ensembles that are invariant under unitary conjugation. Let $I$ be a finite union of intervals lying in the bulk, and let $m_{k}^{(n)}$ be the $k$-th largest gap between consecutive eigenvalues…

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

We show that the Weil-Petersson probability that a random surface has first eigenvalue of the Laplacian less than $3/16-\epsilon$ goes to zero as the genus goes to infinity.

A special type of geometric situation in ensembles of non-intersecting paths occurs when the non-intersecting trajectories are required to be nonnegative so that the limit shape becomes tangential to the hard-edge $0$. The local fluctuation…

In this paper, we consider the bounds for the largest eigenvalue and the sum of the $k$ largest Laplacian eigenvalues of signed graphs. Firstly, we give an upper bound on the largest eigenvalue of the adjacency matrix of a signed graph and…

Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…

The probability that an interval $I$ is free of eigenvalues in a matrix ensemble with unitary symmetry is given by a Fredholm determinant. When the weight function in the matrix ensemble is a classical weight function, and the interval $I$…

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…