​Random Matrices are one of the major research areas in modern probability theory, due to their prominence in many different fields such as nuclear physics, statistics, telecommunication, free probability, non-commutative geometry, and dynamical systems. A great deal of recent work has focused on the study of spectra of large random matrices on the one hand and on iterated random functions, especially random difference equations, on the other. However, the methods applied in these two research areas are fairly dissimilar. Motivated by the idea that tools from one area could potentially also be helpful in the other, the volume editors have selected contributions that present results and methods from random matrix theory as well as from the theory of iterated random functions. This work resulted from a workshop that was held in Münster, Germany in 2011. The aim of the workshop was to bring together researchers from two fields of probability theory: random matrix theory and the theory of iterated random functions. Random matrices play fundamental, yet very different roles in the two fields. Accordingly, leading figures and young researchers gave talks on their field of interest that were also accessible to a broad audience.

During the weekend of March 16-18, 1990 the University of North Carolina at Charlotte hosted a conference on the subject of stochastic flows, as part of a Special Activity Month in the Department of Mathematics. This conference was supported jointly by a National Science Foundation grant and by the University of North Carolina at Charlotte. Originally conceived as a regional conference for researchers in the Southeastern United States, the conference eventually drew participation from both coasts of the U. S. and from abroad. This broad-based par ticipation reflects a growing interest in the viewpoint of stochastic flows, particularly in probability theory and more generally in mathematics as a whole. While the theory of deterministic flows can be considered classical, the stochastic counterpart has only been developed in the past decade, through the efforts of Harris, Kunita, Elworthy, Baxendale and others. Much of this work was done in close connection with the theory of diffusion processes, where dynamical systems implicitly enter probability theory by means of stochastic differential equations. In this regard, the Charlotte conference served as a natural outgrowth of the Conference on Diffusion Processes, held at Northwestern University, Evanston Illinois in October 1989, the proceedings of which has now been published as Volume I of the current series. Due to this natural flow of ideas, and with the assistance and support of the Editorial Board, it was decided to organize the present two-volume effort.

Providing an elementary introduction to branching random walks, the main focus of these lecture notes is on the asymptotic properties of one-dimensional discrete-time supercritical branching random walks, and in particular, on extreme positions in each generation, as well as the evolution of these positions over time. Starting with the simple case of Galton-Watson trees, the text primarily concentrates on exploiting, in various contexts, the spinal structure of branching random walks. The notes end with some applications to biased random walks on trees.

Random matrices now play a role in many areas of theoretical, applied, and computational mathematics. It is therefore 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 achieve all of these goals. This monograph offers an invitation to the field of matrix concentration inequalities. It begins with some history of random matrix theory; it describes a flexible model for random matrices that is suitable for many problems; and it discusses the most important matrix concentration results. To demonstrate the value of these techniques, the presentation includes examples drawn from statistics, machine learning, optimization, combinatorics, algorithms, scientific computing, and beyond.

Mathematics of Computing -- General.

In this monograph the authors give a systematic approach to the probabilistic properties of the fixed point equation X=AX+B. A probabilistic study of the stochastic recurrence equation X_t=A_tX_{t-1}+B_t for real- and matrix-valued random variables A_t, where (A_t,B_t) constitute an iid sequence, is provided. The classical theory for these equations, including the existence and uniqueness of a stationary solution, the tail behavior with special emphasis on power law behavior, moments and support, is presented. The authors collect recent asymptotic results on extremes, point processes, partial sums (central limit theory with special emphasis on infinite variance stable limit theory), large deviations, in the univariate and multivariate cases, and they further touch on the related topics of smoothing transforms, regularly varying sequences and random iterative systems. The text gives an introduction to the Kesten-Goldie theory for stochastic recurrence equations of the type X_t=A_tX_{t-1}+B_t. It provides the classical results of Kesten, Goldie, Guivarc'h, and others, and gives an overview of recent results on the topic. It presents the state-of-the-art results in the field of affine stochastic recurrence equations and shows relations with non-affine recursions and multivariate regular variation.

An integrated package of powerful probabilistic tools and key applications in modern mathematical data science.

This volume opens the world of free probability to a wide variety of readers. From its roots in the theory of operator algebras, free probability has intertwined with non-crossing partitions, random matrices, applications in wireless communications, representation theory of large groups, quantum groups, the invariant subspace problem, large deviations, subfactors, and beyond. This book puts a special emphasis on the relation of free probability to random matrices, but also touches upon the operator algebraic, combinatorial, and analytic aspects of the theory. The book serves as a combination textbook/research monograph, with self-contained chapters, exercises scattered throughout the text, and coverage of important ongoing progress of the theory. It will appeal to graduate students and all mathematicians interested in random matrices and free probability from the point of view of operator algebras, combinatorics, analytic functions, or applications in engineering and statistical physics.