meanRecurrenceTimes {smmR}R Documentation

Method to get the mean recurrence times μ\mu

Description

Method to get the mean recurrence times μ\mu.

Usage

meanRecurrenceTimes(x, klim = 10000)

Arguments

x

An object of S3 class smmfit or smm.

klim

Optional. The time horizon used to approximate the series in the computation of the mean sojourn times vector mm (cf. meanSojournTimes function).

Details

Consider a system (or a component) SystemS_{ystem} whose possible states during its evolution in time are E={1,,s}E = \{1,\dots,s\}.

We are interested in investigating the mean recurrence times of a discrete-time semi-Markov system SystemS_{ystem}. Consequently, we suppose that the evolution in time of the system is governed by an E-state space semi-Markov chain (Zk)kN(Z_k)_{k \in N}. The state of the system is given at each instant kNk \in N by ZkZ_k: the event {Zk=i}\{Z_k = i\}.

Let T=(Tn)nNT = (T_{n})_{n \in N} denote the successive time points when state changes in (Zn)nN(Z_{n})_{n \in N} occur and let also J=(Jn)nNJ = (J_{n})_{n \in N} denote the successively visited states at these time points.

The mean recurrence of an arbitrary state jEj \in E is given by:

μjj=iEν(i)miν(j)\mu_{jj} = \frac{\sum_{i \in E} \nu(i) m_{i}}{\nu(j)}

where (ν(1),,ν(s))(\nu(1),\dots,\nu(s)) is the stationary distribution of the embedded Markov chain (Jn)nN(J_{n})_{n \in N} and mim_{i} is the mean sojourn time in state iEi \in E (see meanSojournTimes function for the computation).

Value

A vector giving the mean recurrence time (μi)i[1,,s](\mu_{i})_{i \in [1,\dots,s]}.


[Package smmR version 1.0.3 Index]