Back to search

University of North Texas

Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory

Abstract

dc: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.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
1993

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Simmons, Dayton C. (Dayton Cooper)
Contributors dc:contributor
  • Brand, Neal E.
  • Monticino, Michael G.
  • Das, Sajal K.
  • Bilyeu, Russell Gene
  • Kung, Joseph P. S.

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • Public
  • Copyright
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
  • Simmons, Dayton C. (Dayton Cooper)
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
call-no: 379 N81d no.3809
untcat: b1768619
local-cont-no: 1002721667-simmons
ark: ark:/67531/metadc277740

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Simmons, Dayton C. (Dayton Cooper). Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory. University of North Texas, 1993. https://digital.library.unt.edu/ark:/67531/metadc277740/