# Robin Pemantle

#### Professor of Mathematics and

Computer and Information Science (CIS)

**Honors and Awards:** Institue of Mathematical Statistics Fellow - 2001, Romnes Fellow - 1997, Sloan foundation Faculty Research Fellow - 1993

**Research Expertise: **Probability Theory | Combinatorics

Robin's research interests include probability theory, where he studies random walks, urn schemes and reinforcement schemes, tree-indexed process, branching processes, any probability model involving trees, discrete potential theory, particle systems, percolation, mixing rates Markov chains, and pathwise properties of Brownian motion. He also studies combinatorics, including asymptotics of multivariable generating functions, optimization, enumerative combinatorics, and spanning trees of graphs.

**Education:**

PhD Probability Theory 1988 - Massachusetts Institute of Technology

- Combinatorial adventures in analysis, algebra, and topology, Melczer, S. | Mishna, M. | Pemantle, R., Notices of the American Mathematical Society, 2020
- Distributed corruption detection in networks, Alon, N. | Mossel, E. | Pemantle, R., Theory of Computing, 2020
- The Perils of Balance Testing in Experimental Design: Messy Analyses of Clean Data, Mutz, D.C. | Pemantle, R. | Pham, P., American Statistician, 2019
- Invasion percolation on galton-watson trees, Michelen, M. | Pemantle, R. | Rosenberg, J., Electronic Journal of Probability, 2019
- Diagonal asymptotics for symmetric rational functions via ACSV, Baryshnikov, Y. | Melczer, S. | Pemantle, R. | Straub, A., Leibniz International Proceedings in Informatics, LIPIcs, 2018