Colloquium: "Asymptotics in Sequences Comparison"
Abstract: Both for random words and random permutations, I will present a panoramic view of recent results on the asymptotic law of the, centered and normalized, length of their longest common (and increasing) subsequences. Tools and results involve concentration inequalities (for geodesics of LCSs paths), Stein' s method as well as maximal eigenvalues of some Gaussian random matrices.
Host: Jose Figueroa-Lopez
Tea will be served @ 3:00pm.