## Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory

Description:
In this dissertation the results of Jerrum and Sinclair on the conductance of Markov chains are used to prove that almost all generalized Steinhaus graphs are rapidly mixing and an algorithm for the uniform generation of 2 - (4k + 1,4,1) cyclic Mendelsohn designs is developed.

Date:
August 1993

Creator:
Simmons, Dayton C. (Dayton Cooper)

Partner:
UNT Libraries