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.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc277740 |
| Date | 08 1900 |
| Creators | Simmons, Dayton C. (Dayton Cooper) |
| Contributors | Brand, Neal E., Monticino, Michael G., Das, Sajal K., Bilyeu, Russell Gene, Kung, Joseph P. S. |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | iii, 72 leaves, Text |
| Rights | Public, Copyright, Copyright is held by the author, unless otherwise noted. All rights reserved., Simmons, Dayton C. (Dayton Cooper) |
Page generated in 0.0022 seconds