November 2, 2009
Alexander Barvinok
University of Michigan
Title: Counting contingency tables: algorithms and asymptotics
Abstract:
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.