Random evolutions processes induced by discrete time Markov chains.
Keepler, M. (1998)
Portugaliae Mathematica
Similarity:
Keepler, M. (1998)
Portugaliae Mathematica
Similarity:
Koichiro Iwata (1992)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
I. Kopocińska, B. Kopociński (1980)
Applicationes Mathematicae
Similarity:
Ronald K. Getoor, Michael J. Sharpe (1979)
Mathematische Zeitschrift
Similarity:
Zbyněk Šidák (1976)
Aplikace matematiky
Similarity:
R. Dohler (1985)
Banach Center Publications
Similarity:
Telecs, András (2000)
Electronic Communications in Probability [electronic only]
Similarity:
Mariusz Górajski (2009)
Annales UMCS, Mathematica
Similarity:
In this paper we consider an absorbing Markov chain with finite number of states. We focus especially on random walk on transient states. We present a graph reduction method and prove its validity. Using this method we build algorithms which allow us to determine the distribution of time to absorption, in particular we compute its moments and the probability of absorption. The main idea used in the proofs consists in observing a nondecreasing sequence of stopping times. Random walk on...
von Weizsäcker, Heinrich
Similarity: