The logarithmic law of random determinant
classification
🧮 math.PR
keywords
randomeqnarrayinftylogarithmicadditionalbegincollectioncondition
read the original abstract
Consider the square random matrix $A_n=(a_{ij})_{n,n}$, where $\{a_{ij}:=a_{ij}^{(n)},i,j=1,\ldots,n\}$ is a collection of independent real random variables with means zero and variances one. Under the additional moment condition \[\sup_n\max_{1\leq i,j\leq n}\mathbb{E}a_{ij}^4<\infty,\] we prove Girko's logarithmic law of $\det A_n$ in the sense that as $n\rightarrow\infty$ \begin{eqnarray*}\frac{\log|\det A_n|-(1/2)\log(n-1)!}{\sqrt{(1/2)\log n}}\stackrel{d}{ \longrightarrow}N(0,1).\end{eqnarray*}
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.