ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FtF_t be the limiting spectral distribution of the noisy sample covariance matrix at noise power t≥0t\geq 0, and let N(t)N(t) denote the number of connected components of its support. Under the standing assumptions of the paper, N(t)∈{1,2}N(t)\in\{1,2\} for all t≥0t\geq 0. Monotonicity conjecture. NN is non-increasing in tt. This would imply that once the separation between the information and noise eigenvalues disappears, it does not reappear as the noise power increases; the paper gives simulations and notes analogous results for other random matrix models, but does not establish the claim.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.