Random permutations and convex chains
Combinatorial Stochastic Processes Seminar
Nov 18, 2011, 01:00 PM - 02:00 PM | 740 Evans Hall | Happening As Scheduled
Gergely Ambrus, Renyi Institute and MSRI (Speaker)
A classical problem in probability, that emerged in the 1970's, is to describe the behaviour of the length of the longest increasing subsequence in a random permutation. By now, this task has been fully accomplished: not only the expectation and the variance is known, but also the properly scaled limit distribution has been determined. Geometrically, the question can be formulated as follows:...