Probabilistic Analysis for Length of the Longest Increasing Subsequences
主 题: Probabilistic Analysis for Length of the Longest Increasing Subsequences
报告人: 苏中根 教授 (浙江大学)
时 间: 2016-12-02 15:00-16:00
地 点: 理科一号楼 1114（数学所活动）
The study of longest increasing subsequences (LIS) dates back to Erdos and Szekeres (1935) . Now it is a well-studied object in random combinatorial optimization and random growth processes. In this talk we will briefly review some remarkable results on the asymptotic distribution theory of LIS, like the law of large numbers (Hammersley’s solution to Ulam’s problem), the central limit theorems (Tracy-Widom law) and large deviation principles. We will also report a recent work on the law of the iterated logarithm for Poissonized version of LIS.