2000 character limit reached
Efron-Stein Inequalities for Random Matrices
Published 15 Aug 2014 in math.PR and math.FA | (1408.3470v1)
Abstract: This paper establishes new concentration inequalities for random matrices constructed from independent random variables. These results are analogous with the generalized Efron-Stein inequalities developed by Boucheron et al. The proofs rely on the method of exchangeable pairs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.