Random evolutions processes induced by discrete time Markov chains.
Keepler, M. (1998)
Portugaliae Mathematica
Similarity:
Displaying similar documents to “On domination and sufficiency in sequential analysis”
Random evolutions processes induced by discrete time Markov chains.
Characterisation of conditional independence structures for polymatroids using vanishing sets
Terence Chan, Qi Chen, Raymond Yeung (2020)
Kybernetika
Similarity:
In this paper, we characterise and classify a list of full conditional independences via the structure of the induced set of vanishing atoms. Construction of Markov random subfield and minimal characterisation of polymatroids satisfying a MRF will also be given.
The inverse of a local operator preserves the Markov property
Koichiro Iwata (1992)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
On system reliability under random load of elements
I. Kopocińska, B. Kopociński (1980)
Applicationes Mathematicae
Similarity:
Some Random Time Dilations of a Markov Process.
Ronald K. Getoor, Michael J. Sharpe (1979)
Mathematische Zeitschrift
Similarity:
Sequential estimation in finite-state Markov processes
S. Trybuła (1982)
Applicationes Mathematicae
Similarity:
Bibliography on Markov chains with a general state space
Zbyněk Šidák (1976)
Aplikace matematiky
Similarity:
A modification of Sudakov's lemma and efficient sequential plans for some jump Markov processes
R. Magiera, R. Różanski (1985)
Banach Center Publications
Similarity:
Reduction of absorbing Markov chain
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...
Sequential estimation of the transition intensities in Markov processes with migration
R. Magiera (1984)
Applicationes Mathematicae
Similarity:
Optimal stopping of a random length sequence of maxima over a random barrier
Z. Porosiński (1988)
Applicationes Mathematicae
Similarity:
On computing the OC and ASN for some Markovian SPRT's
Georgica Obreja, Gheorghita Zbaganu (1985)
Banach Center Publications
Similarity: