A certain curious feature of random objects, introduced by the author as "super concentration," and two related topics, "chaos" and "multiple valleys," are highlighted in this book. Although super concentration has established itself as a recognized feature in a number of areas of probability theory in the last twenty years (under a variety of names), the author was the first to discover and explore its connections with chaos and multiple valleys. He achieves a substantial degree of simplification and clarity in the presentation of these findings by using the spectral approach.

Understanding the fluctuations of random objects is one of the major goals of probability theory and a whole subfield of probability and analysis, called concentration of measure, is devoted to understanding these fluctuations. This subfield offers a range of tools for computing upper bounds on the orders of fluctuations of very complicated random variables. Usually, concentration of measure is useful when more direct problem-specific approaches fail; as a result, it has massively gained acceptance over the last forty years. And yet, there is a large class of problems in which classical concentration of measure produces suboptimal bounds on the order of fluctuations. Here lies the substantial contribution of this book, which developed from a set of six lectures the author first held at the Cornell Probability Summer School in July 2012.

The book is interspersed with a sizable number of open problems for professional mathematicians as well as exercises for graduate students working in the fields of probability theory and mathematical physics. The material is accessible to anyone who has attended a graduate course in probability.

This book addresses the emerging body of literature on the study of rare events in random graphs and networks. For example, what does a random graph look like if by chance it has far more triangles than expected? Until recently, probability theory offered no tools to help answer such questions. Important advances have been made in the last few years, employing tools from the newly developed theory of graph limits. This work represents the first book-length treatment of this area, while also exploring the related area of exponential random graphs. All required results from analysis, combinatorics, graph theory and classical large deviations theory are developed from scratch, making the text self-contained and doing away with the need to look up external references. Further, the book is written in a format and style that are accessible for beginning graduate students in mathematics and statistics.