Gillespie Jr., Perry
The Study of Loop Markov Chains
1 online resource (61 pages) : PDF
University of North Carolina at Charlotte
The purpose of my research is the study of <&ldquo>Loop<&rdquo> Markov Chains. This model contains several loops, which could be connected at several different points. The focal point of this thesis will be when these loops are connected at one single point. Inside each loop are finitely many points. If the process is currently at the position where all the loops are connected, it will stay at its current position or move to the first position in any loop with a positive probability. Once within the loop, the movement can be deterministic or random. We'll consider the Optimal Stopping Problem for finding the optimal stopping set and the Spectral Analysis for our <&ldquo>Loop<&rdquo> system. As a basis, we'll start with the Elimination Algorithm and a modified version of the Elimination Algorithm. None of these algorithms are efficient enough for finding the optimal stopping set of our <&ldquo>Loop<&rdquo> Markov Chain; therefore, I propose a second modification of the Elimination Algorithm, the Lift Algorithm. The <&ldquo>Loop<&rdquo> Markov Chain will dictate which algorithm or combination of algorithms, would be appropriate to find the optimal set. The second part of this thesis will examine the Analysis of the Covariance Operator for our <&ldquo>Loop<&rdquo> Markov Chain system.
ELIMINATION ALGORITHMMARKOV CHAINSOPTIMAL STOPPING PROBLEM
Sonin, IsaacMolchanov, Stanislav
Sonin, IsaacMolchanov, StanislavQuinn, JosephXu, Terry
Thesis (Ph.D.)--University of North Carolina at Charlotte, 2011.
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). For additional information, see http://rightsstatements.org/page/InC/1.0/.
Copyright is held by the author unless otherwise indicated.