Alexei Borodin. He graduated from University of Pennsylvania in 2001, was at Caltech for several years and is now at MIT. Quoting the blurb here, "Borodin studies problems on the interface of representation theory and probability that link to combinatorics, random matrix theory, and integrable systems."
The aforementioned areas come together in the study of the KPZ universality class, a family of random processes whose fluctuations converge to Tracy-Widom distributions when appropriately rescaled. Conjecturally, these processes should be robust to minor perturbations in much the same way as the central limit theorem says any reasonable averaging process has Gaussian fluctuations. He has been studying problems related to KPZ from the beginning of his career. Many of these results are based on asymptotic analysis of random representation theoretic objects. One of his major breakthroughs is the introduction of Macdonald processes. These provide a unifying framework for several of the models known to belong to the KPZ universality class, and allow for certain perturbations to the models.
There are lecture notes by Borodin on these topics with an excellent introduction for those new to these ideas.