Return to Colloquia & Seminar listing
Random sorting networks and last passage percolation
Probability| Speaker: | Dan Romik, UC Davis |
| Related Webpage: | https://www.math.ucdavis.edu/~romik/ |
| Location: | 1147 MSB |
| Start time: | Fri, Feb 14 2020, 2:10PM |
Description
The oriented swap process is a model for a random sorting network, in
which N particles labeled 1,...,N arranged on the discrete lattice
[1,N] start out in increasing order and then perform successive adjacent
swaps at random times until they reach the reverse configuration
N,...,1.
In this talk, based on joint work with Elia Bisi, Fabio
Cunden and Shane Gibbons, I will discuss several new exact
distributional identities between a random vector encoding the
termination time and random vectors in the corner growth process, a
well-known model for randomly growing Young diagrams, or equivalently
what is known as last passage percolation. The main identity is still
conjectural, and would imply a limiting Tracy-Widom GOE law for the
termination time.
The talk will include entertaining computer simulations and a demonstration of computer-assisted proofs.
Note different time and date.