Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory

PDF Version Also Available for Download.

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.

Physical Description

iii, 72 leaves

Creation Information

Simmons, Dayton C. (Dayton Cooper) August 1993.

Context

This dissertation is part of the collection entitled: UNT Theses and Dissertations and was provided by the UNT Libraries to the UNT Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 152 times. More information about this dissertation can be viewed below.

Who

People and organizations associated with either the creation of this dissertation or its content.

Publisher

Rights Holder

For guidance see Citations, Rights, Re-Use.

  • Simmons, Dayton C. (Dayton Cooper)

Provided By

UNT Libraries

The UNT Libraries serve the university and community by providing access to physical and online collections, fostering information literacy, supporting academic research, and much, much more.

Contact Us

What

Descriptive information to help identify this dissertation. Follow the links below to find similar items on the Digital Library.

Degree Information

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.

Physical Description

iii, 72 leaves

Subjects

Keywords

Library of Congress Subject Headings

Language

Identifier

Unique identifying numbers for this dissertation in the Digital Library or other systems.

Collections

This dissertation is part of the following collection of related materials.

UNT Theses and Dissertations

Theses and dissertations represent a wealth of scholarly and artistic content created by masters and doctoral students in the degree-seeking process. Some ETDs in this collection are restricted to use by the UNT community.

What responsibilities do I have when using this dissertation?

When

Dates and time periods associated with this dissertation.

Creation Date

  • August 1993

Added to The UNT Digital Library

  • March 24, 2014, 8:07 p.m.

Description Last Updated

  • Jan. 29, 2015, 8:52 a.m.

Usage Statistics

When was this dissertation last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 152

Interact With This Dissertation

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Simmons, Dayton C. (Dayton Cooper). Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory, dissertation, August 1993; Denton, Texas. (https://digital.library.unt.edu/ark:/67531/metadc277740/: accessed March 19, 2024), University of North Texas Libraries, UNT Digital Library, https://digital.library.unt.edu; .

Back to Top of Screen