pith. sign in

arxiv: 1405.0680 · v1 · pith:OUUFQW2Lnew · submitted 2014-05-04 · 🧮 math.ST · stat.TH

A useful variant of the Davis--Kahan theorem for statisticians

classification 🧮 math.ST stat.TH
keywords populationconditiondavis--kahandistanceeigenvaluesampleseparationspanned
0
0 comments X
read the original abstract

The Davis--Kahan theorem is used in the analysis of many statistical procedures to bound the distance between subspaces spanned by population eigenvectors and their sample versions. It relies on an eigenvalue separation condition between certain relevant population and sample eigenvalues. We present a variant of this result that depends only on a population eigenvalue separation condition, making it more natural and convenient for direct application in statistical contexts, and improving the bounds in some cases. We also provide an extension to situations where the matrices under study may be asymmetric or even non-square, and where interest is in the distance between subspaces spanned by corresponding singular vectors.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Graph-Theoretic Detection of Hilbert Space Fragmentation

    cond-mat.str-el 2026-05 unverdicted novelty 7.0

    Spectral graph analysis of the Hilbert-space connectivity graph detects exact fragmentation and nearly fragmented sectors with slow leakage in the t-J model and Hubbard chain.