Trench's asymptotic absolute equidistribution conjecture for random geometric graph spectra
Statement
Let and be the matrices associated with the random geometric graph and its deterministic comparison model, and let and denote their th largest eigenvalues. Trench's asymptotic absolute equidistribution conjecture. For any ,
The conjecture strengthens asymptotic equidistribution by requiring the matched eigenvalues to become asymptotically indistinguishable in mean square after applying every continuous function. It is presented as being suggested by simulations and attributed to Trench; the supplied text gives no resolution.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.