
The EM algorithm is used to develop procedures for estimating the interoccurrence distributions when n independent and identically distributed cyclic semi-Markov processes, each being ergodic, irreducible and in equilibrium, are observed over finite windows. This work is an extension of the work of \textit{Y. Vardi} [Ann. Stat. 10, 616-620 (1982; Zbl 0491.62034), and ibid., 772-785 (1982; Zbl 0502.62036)] who considers a similar problem for renewal processes and develops the RT algorithm for estimation of the common interoccurrence distribution.
Markov processes: estimation; hidden Markov models, alternating renewal process, cyclic semi- Markov processes, length bias, equilibrium, ergodic, Markov renewal processes, semi-Markov processes, estimation of sojourn time distributions, nonparametric maximum likelihood, finite windows, EM algorithm, irreducible
Markov processes: estimation; hidden Markov models, alternating renewal process, cyclic semi- Markov processes, length bias, equilibrium, ergodic, Markov renewal processes, semi-Markov processes, estimation of sojourn time distributions, nonparametric maximum likelihood, finite windows, EM algorithm, irreducible
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
