Spectral approximation for the separable covariance mixture model
Abstract
This paper introduces the separable covariance mixture model, which assumes a data-matrix Y to be of the form Σr=1R Ar X Br for one random (d × n)-matrix X with independent centered variance-one entries, and for two families of deterministic matrices A1,…,AR ∈ Cd × d and B1,…,BR ∈ Cn × n. Under certain assumptions, it is shown that the resolvents (1n Y Y* - z Idd)-1 and (1n Y* Y - z Idn)-1 respectively approximate the deterministic matrices -1z( Idd + Σr,s=1R δ(B)r,s(z) Ar As* )-1 \ \ and \ \ -1z( Idn + Σr,s=1R δ(A)r,s(z) Bs*Br )-1 \ , where δ(A), δ(B) ∈ CR × 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 (Ar)r ≤ R or (Br)r ≤ 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 1n Y Y* or 1n Y* Y, is included.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.