3 research outputs found
On the identifiability of the two-state BMAP
The capability of modeling non-exponentially distributed and dependent inter-arrival times as
well as correlated batches makes the Batch Markovian Arrival Processes (BMAP) suitable in
different real-life settings as teletraffic, queueing theory or actuarial contexts. An issue to be
taken into account for estimation purposes is the identifiability of the process. This is an open
problem concerning BMAP-related processes. This paper explores the identifiability issue of the
two-state BMAP noted BMAP2(k), where k is the maximum batch arrival size. It is proven
that for k = 2 the process cannot be identified, under the assumptions that both the interarrival
times and batches sizes are observed. Additionally, a method to obtain an equivalent BMAP2(2)
to a given one is provided.Research partially supported by research grants and projects ECO2011-25706 and
MTM2009-14039 (Ministerio de Ciencia e Innovación, Spain) and FQM329 (Junta de Andalucía, Spain),
all with EU ERDF funds. The third author was supported by Consolider "Ingenio Mathematica" through
her post-doc contract
Fitting and Interpreting Continuous-Time Latent Markov Models for Panel Data
Multistate models are used to characterize disease processes within an individual. Clinical studies often observe the disease status of individuals at discrete time points, making exact times of transitions between disease states unknown. Such panel data pose considerable modeling challenges. Assuming the disease process progresses according a standard continuous-time Markov chain (CTMC) yields tractable likelihoods, but the assumption of exponential sojourn time distributions is typically unrealistic. More flexible semi-Markov models permit generic sojourn distributions yet yield intractable likelihoods for panel data in the presence of reversible transitions. One attractive alternative is to assume that the disease process is characterized by an underlying latent CTMC, with multiple latent states mapping to each disease state. These models retain analytic tractability due to the CTMC framework but allow for flexible, duration-dependent disease state sojourn distributions. We have developed a robust and efficient expectation-maximization (EM) algorithm in this context. Our complete data state space consists of the observed data and the underlying latent trajectory, yielding computationally efficient expectation and maximization steps. Our algorithm outperforms alternative methods measured in terms of time to convergence and robustness. We also examine the frequentist performance of latent CTMC point and interval estimates of disease process functionals based on simulated data. The performance of estimates depends on time, functional, and data-generating scenario. Finally, we illustrate the interpretive power of latent CTMC models for describing disease processes on a data-set of lung transplant patients. We hope our work will encourage wider use of these models in the biomedical setting