Copula-Robust Cramér–Rao Lower Bound underDependent Random Censoring
Uzbekistan Journal of Mathematics and Computer Science · 2026
DOI: 10.56143/ujmcs.v2i3s.3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Uzbekistan Journal of Mathematics and Computer Science, 2026. Verfasst von Abdurakhim Abdushukurov und 1 weiteren Autor:innen.
Abstract (Originalsprache)
In survival analysis and reliability theory, the classical Cramér–Rao lower bound assumes independence between lifetime and censoring variables. This paper extends the bound to dependent censoring using a copula-based likelihood. We derive a robust Godambe information bound and prove a generalized Cramér–Rao inequality. The result reduces to the classical bound under independence and shows increased variance bounds with stronger dependence.
Zitieren
APA
Abdushukurov, A., & Muradov, R. (2026). Copula-Robust Cramér–Rao Lower Bound underDependent Random Censoring. Uzbekistan Journal of Mathematics and Computer Science. https://doi.org/10.56143/ujmcs.v2i3s.3
Vancouver
Abdushukurov A, Muradov R. Copula-Robust Cramér–Rao Lower Bound underDependent Random Censoring. Uzbekistan Journal of Mathematics and Computer Science. 2026. doi:10.56143/ujmcs.v2i3s.3
BibTeX
@article{Abdushukurov2026,
author = {Abdushukurov, Abdurakhim and Muradov, Rustamzhon},
title = {Copula-Robust Cramér–Rao Lower Bound underDependent Random Censoring},
journal = {Uzbekistan Journal of Mathematics and Computer Science},
year = {2026},
doi = {10.56143/ujmcs.v2i3s.3}
}
EUVIMED