Counting contingency tables: algorithms and asymptotics

Joint ACO and ARC Colloquium
Monday, November 2, 2009 - 2:00pm for 1 hour (actually 50 minutes)
Klaus 1116W
Alexander Barvinok – University of Michigan

Please Note: Tea and light refreshments 1:30 in Room 2222. Organizer: Santosh Vempala

I will discuss recent progress on the construction of randomized algorithms for counting non-negative integer matrices with prescribed row and column sums and on finding asymptotic formulas for the number of such matrices (also known as contingency tables). I will also discuss what a random (with respect to the uniform measure) non-negative integer matrix with prescribed row and column sums looks like.