For more information about this meeting, contact Yakov Pesin, Manfred Denker.
|Title:||Directed last passage percolation|
|Seminar:||Department of Mathematics Colloquium|
|Speaker:||Jinho Baik, University of Michigan|
Imagine that one travels from the origin to a site (M,N) through a sequence of neighboring integer lattice sites. The condition is that only north-moves and east-moves are allowed. It takes certain amount of time to pass through a given site and this time is different from site to site. If the passage times at sites are random, what is the maximal time to go from (0,0) to (M,N)? This question is related to 2-D random growth models, interacting particle systems and tandem queues. Moreover for some special choice of random variables, the answer is related to random matrix theory and also combinatorics of partitions. We will survey some results and recent developments related to this question.|
Room Reservation Information
|Date:||02 / 09 / 2012|
|Time:||04:00pm - 05:00pm|