David Aldous (UC Berkeley)
“Limits for Processes over General Networks”
See attached: April 23.pdf
“A Set of a Finite Perimeter and a Variational Problem”
Bryna Kra (Northwestern)
“Dynamics of Systems with Low Complexity”
One way to classify dynamical systems is by their entropy, which roughly speaking gives a measure of the disorder in the system. Deterministic systems have zero entropy, but in spite of this structure, many basic questions about entropy zero systems remain open, even with stronger restrictions placed on the complexity in the system.
“Coloring with Martingales”
Carolyn Abbott (UC Berkeley)
“Acylindrical Actions on Hyperbolic Spaces”
The class of acylindrically hyperbolic groups consists of groups that admit a particular nice type of non-elementary action on a hyperbolic space, called an acylindrical action. This class contains many interesting groups such as non-exceptional mapping class groups, Out(Fn) for n > 1, and right-angled Artin and Coxeter groups, among many others.
Sean Howe (Stanford)
“Motivic Random Variables and Random Matrices”
As first shown by Katz-Sarnak, the zero spacing of L-functions of smooth plane curves over finite fields approximate the infinite random matrix statistics observed experimentally for the zero spacing of the Riemann-Zeta function (arbitrarily well by first taking the size of the finite field to infinity, and then the degree of the curve to infinity).