Let {X a } a∈Z be an irreducible and aperiodic Markov chain on a ÿnite state space S = {0;
On order statistics in waiting time for runs in Markov chains
✍ Scribed by Dragan Banjević
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 151 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we obtain exact and recurrence formulae for the probability functions and the probability generating functions of Y, based on four different ways of counting numbers of success runs (i.e. overlapping success runs, non-overlapping runs, the runs with a specified length k or more and the
07 Alternative energy sources (solar energy) 02/01004 Diffuse solar irradiation model evaluation in the North Mediterranean Belt area De Miguel, A. cr rrl. Solrrr Energy, 2001, 70, (2
Many stochastic models in queueing, inventory, communications, and dam theories, etc., result in the problem of numerically determining the minimal nonnegative solutions for a class of nonlinear matrix equations. Various iterative methods have been proposed to determine the matrices of interest. We