Urn models have a storied part in the history of probability and have been studied extensively over the past century for their wide range of applications. We analyze a generalized class of urn models introduced in the past decade, the so-called "multiset" class, in which more than one ball is sampled at a time. We investigate sufficient conditions for a multiset urn process to be tenable, meaning the process can continue indefinitely without getting stuck. We fully characterize the "strongly tenable" class of Pólya urn schemes, which is tenable under any starting conditions that allow the process to begin. We find several "weakly tenable" classes of Pólya urn schemes that are tenable only under restricted starting conditions. We enumerate the size of some of these tenable classes using combinatorics, probabilistically analyze them, and provide an algorithm to assess the tenability of an arbitrary urn scheme using breadth-first search. We further analyze the computational complexity of the tenability problem itself. By showing how to encode the Boolean satisfiability problem within a Pólya urn scheme, we find that the problem of determining whether a multiset urn scheme is untenable is in the complexity class NP-hard, and this places constraints on the kinds of tenability theorems we can hope to find. Finally, we analyze a generalized “fault tolerant” urn model that can take action to avoid getting stuck, and by showing that this model is Turing-equivalent, we show that the tenability problem for this model is undecidable.
|Advisor:||Mahmoud, Hosam M.|
|Commitee:||Balaji, Srinivasan, Barta, Winfried|
|School:||The George Washington University|
|School Location:||United States -- District of Columbia|
|Source:||DAI-B 78/08(E), Dissertation Abstracts International|
|Subjects:||Statistics, Computer science|
|Keywords:||Pólya urn, Random structure|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be