IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v52y2023i11p3652-3660.html
   My bibliography  Save this article

Markov's inequality: Sharpness, renewal theory, finite samples, reliability theory

Author

Listed:
  • Mark Brown
  • Joel E. Cohen

Abstract

We examine Markov's inequality in the light of renewal theory and reliability theory. Suppose the non negative random variable (rv) X has cumulative distribution function (cdf) F with survival function F¯≔Pr⁡(X>x)=1−F and left-continuous version of the survival function F¯(x−)≔Pr⁡(X≥x), x≥0. We determine the points, if any, such that x≥μ and F¯(x−)=μ/x. We offer an alternative proof of Markov's inequality by observing that, if some collection of events {At:t≥0} exists such that Pr⁡(At)=tF¯(t−)/μ, then because tF¯(t−)/μ equals a probability, it must satisfy tF¯(t−)/μ≤1, which is equivalent to Markov's inequality. We choose events connected to stationary renewal processes. When we know only the sample size n and the sample average x¯n of n non negative observations x1,…, xn, we establish an upper bound on the left-continuous version of the empirical survival function that improves Markov's inequality. We show that an upper bound of Markov type for the survival function is sharp when F is “new better than used in expectation” (NBUE) or has “decreasing mean residual life” (DMRL).

Suggested Citation

  • Mark Brown & Joel E. Cohen, 2023. "Markov's inequality: Sharpness, renewal theory, finite samples, reliability theory," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(11), pages 3652-3660, June.
  • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:11:p:3652-3660
    DOI: 10.1080/03610926.2021.1977960
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2021.1977960?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:lstaxx:v:52:y:2023:i:11:p:3652-3660. 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/lsta .

    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.