A combinatoric approach to the Kaplan-Meier estimator (Q1063972)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A combinatoric approach to the Kaplan-Meier estimator
scientific article

    Statements

    A combinatoric approach to the Kaplan-Meier estimator (English)
    0 references
    1985
    0 references
    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.
    0 references
    Kaplan-Meier estimator
    0 references
    censoring
    0 references
    Chebychev's inequality
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references