Skip to content
Preprint

The Central Limit Theorem and Berry--Esseen bound for logarithmic law of random determinants

Sep 2026 · 0 citations
Mathematics

Abstract

Let $A=(A_n)_{n\ge2}$ be a triangular array of random matrices, where $A_n=(a_{ij})_{1\le i,j\le n}$ is an $n\times n$ random matrix with independent real entries satisfying $\mathbb E a_{ij}=0$ and $\mathbb Ea_{ij}^2=1$, and put $\mathcal L_n=\log|\det A_n|$ and \[ W_n^{\mathrm d}(A_n):=\frac{\mathcal L_n - \frac12\log(n-1)!}{\sqrt{\frac12\log n}},\quad W_n^{\mathrm e}(A_n):= \frac{\mathcal L_n-\mathbb E \mathcal L_n}{\sqrt{\frac12\log n}}. \] We prove that $W_n^{\mathrm d}(A_n) \Rightarrow \mathcal N(0,1)$, whenever the family $\left\{\frac{|a_{ij}|^{4}}{\sqrt{\log(e+|a_{ij}|)}} \right\}_{n\geq 2;1\leq i,j\leq n}$ is uniformly integrable. If, in addition, the entries have uniformly bounded densities, then $W_n^{\mathrm e}(A_n) \Rightarrow \mathcal N(0,1)$ whenever the family $\left\{\frac{|a_{ij}|^{4}}{\log(e+|a_{ij}|)}\right\}_{n\geq 2;1\leq i,j\leq n} $ is uniformly integrable. These two conditions are optimal at the level of universal moment assumptions. We further establish the corresponding Berry--Esseen bounds, and show that for $0<\delta\le\tfrac12$, if $\sup\limits_{n}\max\limits_{1\le i,j\le n}\mathbb E \frac{|a_{ij}|^4} {\{\log(e+|a_{ij}|)\}^{1/2-\delta}}<\infty$, then \begin{align*} d_{\mathrm K}(W_n^{\mathrm d}(A_n),\mathcal N(0,1))\le C(\log n)^{-\delta}. \end{align*} For $0<\gamma\le1$, if $\sup\limits_{n}\max\limits_{1\le i,j\le n}\mathbb E \frac{|a_{ij}|^4} {\{\log(e+|a_{ij}|)\}^{1-\gamma}}<\infty$ and the entries have uniformly bounded densities, then \begin{align*} d_{\mathrm K}(W_n^{\mathrm e}(A_n),\mathcal N(0,1))\le C(\log n)^{-\gamma}. \end{align*} When $\delta = 1/2$ and $\gamma = 1$, the bounds $(\log n)^{-1/2}$ and $(\log n)^{-1}$ are optimal, respectively. Our results improve the earlier Central Limit Theorem by \cite{BaoPanZhou2015} and the Berry--Esseen bound by \cite{NguyenVu2014}.

View source

Similar papers

Preprint Sep 2026

Effective estimates for exponential sums with multiplicative coefficients

Let $f$ be multiplicative, with $|f(p)|\le A$ at primes and $\sum_{n\le x}|f(n)|^2\le A^2x$ for every $x\ge1$. If $|\alpha-a/q|\le q^{-2}$, $(a,q)=1$, and $3\le R\le q\le N/R$, we prove \[ \sum_{n\le N}f(n)\operatorname{e}(n\alpha) \ll_A \frac{N}{\log N} +\frac{N}{\sqrt R}\sqrt{\log\log(3R)} \] with effective implied c...

Nicolas Robles · 0 citations
Preprint Aug 2026

Szeg\H{o}-type determinant asymptotics for generalized Hilbert matrices with edge eigenvalues

We compute the large-$N$ asymptotics of the determinant of the identity plus or minus a generalized Hilbert matrix. For $N \in \mathbb{N}$ and $\delta \in \mathbb{R} \setminus \{-1, -2, \ldots\}$, let \[ H_N^\delta := \left( \frac{\sin((1+\delta)\pi)}{\pi(j+k+1+\delta)} \right)_{j,k=0}^{N-1} \] be the generalized Hilbe...

Martin Gebert, Heinrich Küttler · 0 citations
Preprint Sep 2026

Asymptotic infinitesimal freeness of covariance matrices

We consider $n\times n$ covariance matrices $M=\frac{1}{n}XX^*$ where $X=(x_{i,j})$ is a matrix whose entries are independent complex random variables with $\mathbb{E}(x_{i,j})=0$ and $\mathbb{E}(|x_{i,j}|^2)=1$. We derive a $\frac{1}{n}$ expansion of the mixed moments, $\frac{1}{n}\mathbb{E}(\Tr(M^{(r_1)}\cdots M^{(r_...

D. George, Pei-Lun Tseng · 1 citation
Preprint Sep 2026

Spectral extremes under exact cycle conditioning

Let $P_n$ be the matrix of a random permutation of $n$ symbols and let $M_n=\log\max_{|z|=1}|\det(I-zP_n)|$. Cook and Zeitouni proved that $M_n/\log n$ converges in probability to a constant $x_0$ for a uniform permutation. We show that the $\sqrt{\log n}$ fluctuations of $M_n$ are carried entirely by the number of cyc...

Zhi-Peng Lu · 0 citations
Preprint Sep 2026

Quantitative linear independence for square roots

We consider the problem of finding lower bounds for integer linear combinations of $\sqrt{a_1},\ldots,\sqrt{a_K}$, where $a_1,\ldots,a_K$ are positive integers such that their square roots are linearly independent over the rationals. We use a probabilistic approach and prove that for $K\geq 8$ and nonzero integers $m_1...

Marco Aymone, Samuel Figueredo, Siddharth Iyer et al. · 0 citations
Preprint Aug 2026

The Maximum of $\operatorname{per}(I-A)$ in Odd Order

Let $\Omega_n$ denote the set of $n\times n$ doubly stochastic matrices. Kim and Roush conjectured in 1981 that, for $n=2k+1>1$, $ \max_{A\in\Omega_{2k+1}}\operatorname{per}(I-A)=3\cdot 2^{k-2}$. They proposed the block construction $A_\star=\frac12(J_3-I_3)\oplus P_2^{\oplus(k-1)}$, where $P_2=\begin{pmatrix}0&1\\1&0\...

Yair Lavi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.