Conjecture on eigenvector coordinate averages for large S-regular matrices
Conjecture on eigenvector coordinate averages for large S-regular matrices
Let be a large -regular matrix, and let be the corresponding -regular matrix on . Let be a sufficiently large subset of the -th partition cell of the underlying graph of . Let be a normalized eigenvector of with eigenvalue , and let be defined as in the paper's vertex-distribution proposition. Write .
Eigenvector coordinate conjecture. With high probability,
and
Here the conjecture predicts that most eigenvectors have approximately zero mean on a large subset of a partition cell, while their average squared coordinates are governed by the limiting spectral measures. The preceding results provide the limiting cumulative distributions, but the asserted coordinate-level approximations remain conjectural.
Sources & referencesView supporting material
Primary source
Matthew B. Crawford, David J. Marchette, William Maxwell and Samuel S. Mendelson, “Spectral properties of random graphs with fixed equitable partition”, arXiv:2311.07675 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.