SearcharxivSearch

arXiv subjects

Ben Deitmar

Publications and source records attributed to Ben Deitmar.

5 recordsLinked to original sources

Spectral approximation for the separable covariance mixture model

This paper introduces the separable covariance mixture model, which assumes a data-matrix $Y$ to be of the form $$ \sum\limits_{r=1}^R A_r X B_r $$ for one random $(d \times n)$-matrix $X$ with independent centered variance-one entries, and for two families of deterministic matrices $A_1,\dots,A_R \in \mathbb{C}^{d \times d}$ and $B_1,\dots,B_R \in \mathbb{C}^{n \times n}$. Under certain assumptions, it is shown that the resolvents $(\frac{1}{n} Y Y^* - z \operatorname{Id}_d)^{-1}$ and $(\frac{1}{n} Y^* Y - z \operatorname{Id}_n)^{-1}$ respectively approximate the deterministic matrices $$ -\frac{1}{z}\Big( \operatorname{Id}_d + \sum\limits_{r,s=1}^R \delta^{(B)}_{r,s}(z) A_{r} A_{s}^* \Big)^{-1} \ \ \text{ and } \ \ -\frac{1}{z}\Big( \operatorname{Id}_n + \sum\limits_{r,s=1}^R \delta^{(A)}_{r,s}(z) B_{s}^*B_{r} \Big)^{-1} \ , $$ where $\delta^{(A)}, \delta^{(B)} \in \mathbb{C}^{R \times R}$ are uniquely defined solutions to a certain dual system of equations. The results are non-asymptotic and do not require simultaneous diagonalizability of the families $(A_r)_{r \leq R}$ or $(B_r)_{r \leq R}$, as was required in previous works such as [Hazarika and Paul (2025)] or [Mei et al. (2023)]. An asymptotic application, which describes the limiting spectral distribution of the sample covariance matrix analogues $\frac{1}{n} Y Y^*$ or $\frac{1}{n} Y^* Y$, is included.

math.ST

Estimation of Population Linear Spectral Statistics by Marchenko--Pastur Inversion

A new method of estimating population linear spectral statistics from high-dimensional data is introduced. When the dimension $d$ grows with the sample size $n$ such that $\frac{d}{n} \to c>0$, the proposed method is the first with proven convergence rate of $\mathcal{O}(n^{\varepsilon - 1})$ for any $\varepsilon > 0$ in a general nonparametric setting. For Gaussian data, a CLT for the estimation error with normalization factor $n$ is shown.

math.ST

Marchenko-Pastur laws for Daniell smoothed periodograms

Given a sample $X_0,...,X_{n-1}$ from a $d$-dimensional stationary time series $(X_t)_{t \in \mathbb{Z}}$, the most commonly used estimator for the spectral density matrix $F(\theta)$ at a given frequency $\theta \in [0,2\pi)$ is the Daniell smoothed periodogram $$S(\theta) = \frac{1}{2m+1} \sum\limits_{j=-m}^m I\Big( \theta + \frac{2\pi j}{n} \Big) \ ,$$ which is an average over $2m+1$ many periodograms at slightly perturbed frequencies. We prove that the Marchenko-Pastur law holds for the eigenvalues of $S(\theta)$ uniformly in $\theta \in [0,2\pi)$, when $d$ and $m$ grow with $n$ such that $\frac{d}{m} \rightarrow c>0$ and $d\asymp n^{\alpha}$ for some $\alpha \in (0,1)$. This demonstrates that high-dimensional effects can cause $S(\theta)$ to become inconsistent, even when the dimension $d$ is much smaller than the sample size $n$. Notably, we do not assume independence of the $d$ components of the time series. The Marchenko-Pastur law thus holds for Daniell smoothed periodograms, even when it does not necessarily hold for sample auto-covariance matrices of the same processes.

math.ST

A recursion formula for mixed trace moments of isotropic Wishart matrices and the Gaussian unitary/orthogonal ensembles

Exact recursion formulas for mixed moments of four fundamental random matrix ensembles are derived. The reason such recursive formulas are possible is closely related to properties of polygon gluings studied by Harer and Zagier as well as Akhmedov and Shakirov. The proofs of the formulas are direct and written in such a way that they do not rely on understanding of polygon gluings.

math.PR

Trace Moments of the Sample Covariance Matrix with Graph-Coloring

Let $S_{p,n}$ denote the sample covariance matrix based on $n$ independent identically distributed $p$-dimensional random vectors in the null-case. The main result of this paper is an explicit expansion of trace moments and power-trace covariances of $S_{p,n}$ simultaneously for both high- and low-dimensional data. To this end we expand a well-known ansatz of describing trace moments as weighted sums over routes or graphs. The novelty to our approach is an inherent coloring of the examined graphs and a decomposition of graphs into their tree-structure and their \textit{seed graphs}, which allows for some elegant formulas explaining the effect of the tree structures on the number of Euler-tours. The weighted sums over graphs become weighted sums over the possible seed graphs, which in turn are much easier to analyze.

math.ST