The identifiability problem for generalised competing risk models with non-symmetric virtual ages

Burnham, M.R. and Bedford, T.J. and Walls, L.A. (2009) The identifiability problem for generalised competing risk models with non-symmetric virtual ages. In: Mathematical Methods in Reliability, 2009-06-22 - 2009-06-27. (Unpublished)

Full text not available in this repository.Request a copy

Abstract

The identifiability problem is well-known in competing risks (1). Recently a generalised competing risks framework was proposed by Doyen and Gaudoin(2), along with several subclasses of this framework which incorporate virtual age models(3). The identifiability problem is still present in generalised competing risk models with symmetrical virtual ages for each of the risks, however it is unclear to what extent this is true for generalised competing risk models with non-symmetrical virtual ages for the risks. Bedford and Lindqvist(4) have constructed an example of a two component system in which, every time a component fails it is restored to a state "as good as new", while the remaining components are restored to a state "as bad as old". In this example they prove that the model can be uniquely identified. Doyen and Gaudoin(2) show that this example is a particular instance of a generalised competing risks model with non-symmetrical virtual ages. In this paper we generalise the Bedford and Lindqvist example to show identifiability of systems with n components. We also discuss how this proof has been constructed to more easily allow for the consideration of other virtual age models in future work.

ORCID iDs

Burnham, M.R., Bedford, T.J. ORCID logoORCID: https://orcid.org/0000-0002-3545-2088 and Walls, L.A. ORCID logoORCID: https://orcid.org/0000-0001-7016-9141;
CORE (COnnecting REpositories)