IDEAS home Printed from https://ideas.repec.org/a/taf/mpopst/v31y2024i1p1-39.html
   My bibliography  Save this article

Inference and optimal censoring scheme for a competing-risks model with type-II progressive censoring

Author

Listed:
  • Yajie Tian
  • Yingna Liang
  • Wenhao Gui

Abstract

For statistical inference of competing risks under type-II progressive censoring, lifetimes are modeled by an inverted exponential Rayleigh distribution, which allows the use of a non-monotonic hazard function. Maximum-likelihood estimators for all parameters exist and are unique. The Newton-Raphson algorithm and maximum stochastic expectation each provide estimates. Confidence intervals result from the Fisher matrix and the asymptotic normality of maximum-likelihood estimators. For small samples, the Bootstrap estimators of the parameters do not need to be asymptotically normal. In addition, the Monte Carlo method with the Metropolis-Hastings algorithm and importance sampling allow for Bayesian estimation, with the associated highest posterior-density intervals. The Bayesian method takes account of prior information, contrary to the frequentist method. The Bootstrap method improves the precision of the estimation, especially in the case of small sample sizes. The estimated range obtained by Bootstrap is between 20% and 60% smaller than that obtained by maximum likelihood. Frequentist and Bayesian estimations using the inverted exponentiated Rayleigh distribution under type-II progressive censoring allow for fitting empirical mouse mortality data and obtaining parameter estimates of this distribution. A quantile-dependent criterion and a quantile-independent criterion are used to determine the optimal censoring and to design the experiment.

Suggested Citation

  • Yajie Tian & Yingna Liang & Wenhao Gui, 2024. "Inference and optimal censoring scheme for a competing-risks model with type-II progressive censoring," Mathematical Population Studies, Taylor & Francis Journals, vol. 31(1), pages 1-39, January.
  • Handle: RePEc:taf:mpopst:v:31:y:2024:i:1:p:1-39
    DOI: 10.1080/08898480.2023.2225349
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/08898480.2023.2225349
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/08898480.2023.2225349?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:mpopst:v:31:y:2024:i:1:p:1-39. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GMPS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.