Show simple item record

dc.contributor.advisorRandall, Dana
dc.contributor.authorBhakta, Prateek Jayeshbhai
dc.date.accessioned2016-08-22T12:25:26Z
dc.date.available2016-08-22T12:25:26Z
dc.date.created2016-08
dc.date.submittedAugust 2016
dc.identifier.urihttp://hdl.handle.net/1853/55689
dc.description.abstractMarkov chains are an essential tool for sampling from large sets, and are ubiquitous across many scientific fields, including statistical physics, industrial engineering, and computer science. To be a useful tool for sampling, the number of steps needed for a Markov chain to converge approximately to the target probability distribution, also known as the mixing time, should be a small polynomial in n, the size of a state. We study problems that arise from the design and analysis of Markov chains that sample from configurations of lattice structures. Specifically, we will be interested in settings where each state is sampled with a non-uniform weight that depends on the structure of the configuration. These weighted lattice models arise naturally in many contexts, and are typically more difficult to analyze than their unweighted counterparts. Our focus will be on exploiting these weightings both to develop new efficient algorithms for sampling and to prove new mixing time bounds for existing Markov chains. First, we will present an efficient algorithm for sampling fixed rank elements from a graded poset, which includes sampling integer partitions of n as a special case. Then, we study the problem of sampling weighted perfect matchings on lattices using a natural Markov chain based on "rotations", and provide evidence towards understanding why this Markov chain has empirically been observed to converge slowly. Finally, we present and analyze a generalized version of the Schelling Segregation model, first proposed in 1971 by economist Thomas Schelling to explain possible causes of racial segregation in cities. We identify conditions under which segregation, or clustering, is likely or unlikely to occur. Our analysis techniques for all three problems are drawn from the interface of theoretical computer science with discrete mathematics and statistical physics.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technology
dc.subjectMarkov chains
dc.subjectMixing rates
dc.titleMarkov chains for weighted lattice structures
dc.typeDissertation
dc.description.degreePh.D.
dc.contributor.departmentComputer Science
thesis.degree.levelDoctoral
dc.contributor.committeeMemberMihail, Milena
dc.contributor.committeeMemberGoldberg, David
dc.contributor.committeeMemberVigoda, Eric
dc.contributor.committeeMemberTetali, Prasad
dc.date.updated2016-08-22T12:25:26Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record