In this paper, we face a generalization of the problem of finding the distribution of how long it takes to reach a "target" set T of states in Markov chain. The graph problems of finding the number of paths that go from a state to a target set and of finding the n-length path connections are shown to belong to this generalization. This paper explores how the state space of the Markov chain can be reduced by collapsing together those states that behave in the same way for the purposes of calculating the distribution of the hitting time of T. We prove the existence and the uniqueness of a optimal projection for this aim which extends the results given in [G. Aletti and E. Merzbach, J. Eur. Math. Soc. (JEMS) 8 (2006) 49–75], together with the existence of a polynomial algorithm which reaches this optimum. Some applied examples are presented. Markov complexity is defined an tested on some classical problems to demonstrate the deeper understanding that is made possible by this approach.
|Titolo:||The behavior of a Markov network with respect to an absorbing class: the target algorithm|
ALETTI, GIACOMO (Primo)
|Parole Chiave:||Graphs and networks; Markov complexity; Markov time of the first passage; Stopping rules|
|Settore Scientifico Disciplinare:||Settore MAT/06 - Probabilita' e Statistica Matematica|
|Data di pubblicazione:||2009|
|Digital Object Identifier (DOI):||10.1051/ro/2009019|
|Appare nelle tipologie:||01 - Articolo su periodico|