Multiple recurrence for discrete time Markov processes
Anzelm Iwanik (1987)
Colloquium Mathematicum
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Multiple recurrence for discrete time Markov processes. II”
Multiple recurrence for discrete time Markov processes
Extended piecewise Markov processes in discrete time
Maria Jankiewicz (1978)
Applicationes Mathematicae
Similarity:
Piecewise Markov processes on a general state space
Maria Jankiewicz, T. Rolski (1977)
Applicationes Mathematicae
Similarity:
Bibliography on Markov chains with a general state space
Zbyněk Šidák (1976)
Aplikace matematiky
Similarity:
The superposition of two independent Markov renewal processes
W. P. Cherry, R. L. Disney (1983)
Applicationes Mathematicae
Similarity:
Extended piecewise Markov processes in continuous time
Maria Jankiewicz (1978)
Applicationes Mathematicae
Similarity:
On the exchanges between Wolfgang Doeblin and Bohuslav Hostinský
Laurent Mazliak (2007)
Revue d'histoire des mathématiques
Similarity:
We present the letters sent by Wolfgang Doeblin to Bohuslav Hostinský between 1936 and 1938. They concern some aspects of the general theory of Markov chains and the solutions of the Chapman-Kolmogorov equation that Doeblin was then establishing for his PhD thesis.
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:
Piecewise Markov processes in discrete time and their certain extensions
I. Kopocińska (1977)
Applicationes Mathematicae
Similarity:
The discrete skeleton method and a total variation limit theorem for continous-time Markov processes.
E. Nummelin (1978)
Mathematica Scandinavica
Similarity:
Accurate calculations of Stationary Distributions and Mean First Passage Times in Markov Renewal Processes and Markov Chains
Jeffrey J. Hunter (2016)
Special Matrices
Similarity:
This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30, 197–207, (1986) procedure. The technique is numerically stable in that it doesn’t involve subtractions. Algebraic expressions for the special cases of one, two, three and four states are derived.Aconsequence of the procedure is that the stationary distribution of the...