A combinatoric approach to the Kaplan-Meier estimator
The paper considers the Kaplan-Meier estimator \(F_ n^{KM}\) from a combinatoric viewpoint. Under the assumption that the estimated distribution F and the censoring distribution G are continuous, the combinatoric results are used to show that \(\int | \theta (z)| dF_ n^{KM}(z)\) has expectation not larger than \(\int | \theta (z)| dF(z)\) for any sample size n. This result is then coupled with Chebychev's inequality to demonstrate the weak convergence of the former integral to the latter if the latter is finite, if F and G are strictly less than 1 on \({\mathcal R}\) and if \(\theta\) is continuous.
- Some convergence results for kernel-type quantile estimators under censoring
- Two-sided bias bound of the Kaplan-Meier estimator
- Glivenko-Cantelli for Kaplan-Meier
- Robust bias estimation for Kaplan-Meier survival estimator with jackknifing
- Kaplan-Meier estimator in competing risk contexts
- Relative deficiency op kernel type estimators of quantiles based on right censored data
- Nonparametric Estimation With Censored Data From A Distributtion With Nonincreasing Density
- scientific article; zbMATH DE number 1057991 (Why is no real title available?)
- On efron's and gill's version of the kaplan-meier integral
- A SIMPLE IMPROVEMENT OF THE KAPLAN-MEIER ESTIMATOR
- Improved estimation under random censorship
- Bias correction on censored least squares regression models
- Censored and extreme losses: functional convergence and applications to tail goodness-of-fit
This page was built for publication: A combinatoric approach to the Kaplan-Meier estimator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063972)
