Event Type:

Probability Seminar

Date/Time:

Thursday, January 13, 2011 - 08:00

Location:

Kidder 350

Guest Speaker:

Institution:

University of Oregon

Abstract:

A combinatorial design is an array whose rows satisfy pairwise contraints, such as orthogonality. By studying an interesting family of random walks, we show that certain combinatorial designs exists, and develop asymptotic formulas for the number of such designs.

Joint work with W. de Launey.