Title: Asymptotics for random combinatorial structures
Speaker: Professor Ofer Zeitouni
Speaker Info: Electrical Engineering, Technion
Brief Description:
Special Note:

How does the longest increasing subsequence of a random parmutation of {1,...,n} look?

How does a random partition of a large integer look?

Consider a random convex polygon of area bounded by 1 and length bounded by 1, with vertices on the lattice {(a/n,b/n): a,b integers}. How does a typical polygon look? What about a-typical ones?

In this talk I will present asymptotic results and variational problems for these and related questions. The techniques involve geometry, combinatorics and probability.

The talk is based on joint works with J.D. Deuschel, A. Vershik and A. Dembo.

Date: Friday, April 17, 1998
Time: 4:30pm
Where: Lunt 105
Contact Person: Prof. Ezra Getzler
Contact email: getzler@math.nwu.edu
Contact Phone: 847-467-1695
Copyright © 1997-2024 Department of Mathematics, Northwestern University.