Abstract
In recent years, random matrices have come to play a major role in
computational mathematics, but most of the classical areas of random matrix
theory remain the province of experts. Over the last decade, with the advent of
matrix concentration inequalities, research has advanced to the point where we
can conquer many (formerly) challenging problems with a page or two of
arithmetic. The aim of this monograph is to describe the most successful
methods from this area along with some interesting examples that these
techniques can illuminate.
Users
Please
log in to take part in the discussion (add own reviews or comments).