Note on sampling without replacing from a finite collection of matrices

Details Note on sampling without replacing from a finite collection of matrices Note on sampling without replacing from a finite collection of matrices

2010-01-15

arxiv.org/abs/1001.2738v2

Computer Science

Information Theory

3 pages. Answers a question raised in arXiv:0910.1879. v2: minus one typo.

Scientific paper

This technical note supplies an affirmative answer to a question raised in a recent pre-print [arXiv:0910.1879] in the context of a "matrix recovery" problem. Assume one samples m Hermitian matrices X_1, ..., X_m with replacement from a finite collection. The deviation of the sum X_1+...+X_m from its expected value in terms of the operator norm can be estimated by an "operator Chernoff-bound" due to Ahlswede and Winter. The question arose whether the bounds obtained this way continue to hold if the matrices are sampled without replacement. We remark that a positive answer is implied by a classical argument by Hoeffding. Some consequences for the matrix recovery problem are sketched.

Affiliated with

Also associated with

No associations

Rating

Note on sampling without replacing from a finite collection of matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Note on sampling without replacing from a finite collection of matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Note on sampling without replacing from a finite collection of matrices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-87959