random matrices now play a role in many areas of theoretical, applied, and computational mathematics. therefore, it is desirable to have tools for studying random matrices that are flexible, easy to use, and powerful. over the last fifteen years, researchers have developed a remarkable family of results, called matrix concentration inequalities, that balance these criteria. this talk offers an invitation to the field of matrix concentration inequalities and their applications. this talk is designed for a general mathematical audience.