Cluster robustness conjecture for randomized small-block Lanczos
Cluster robustness conjecture for randomized small-block Lanczos
Let be real diagonal matrices, and assume that and have disjoint spectra for . Let be a Gaussian random matrix with . The quantities and , defined in the paper, measure the relevant polynomial-growth and coefficient effects in the cluster-robustness bound. Cluster robustness conjecture. With high probability, the product is bounded by a constant depending only on and , independently of the matrices for . This would make the spectral-gap dependence in the cluster-robustness estimate uniform over the diagonal blocks, beyond the currently established upper bound.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Nian Shao, “A structural bound for cluster robustness of randomized small-block Lanczos”, arXiv:2507.10144 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.