IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v47y2000i3p295-300.html
   My bibliography  Save this article

A note on the sequence of expected extremes

Author

Listed:
  • Kolodynski, Slawomir

Abstract

Necessary and sufficient conditions for a sequence to be an expectation sequence of maximal (or minimal) order statistics are obtained. Applications to the study of convergence in distribution are given.

Suggested Citation

  • Kolodynski, Slawomir, 2000. "A note on the sequence of expected extremes," Statistics & Probability Letters, Elsevier, vol. 47(3), pages 295-300, April.
    • Handle: RePEc:eee:stapro:v:47:y:2000:i:3:p:295-300
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(99)00169-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Balakrishnan, N., 1990. "Improving the hartley-David-Gumbel bound for the mean of extreme order statistics," Statistics & Probability Letters, Elsevier, vol. 9(4), pages 291-294, April.
    2. Huang, J. S., 1998. "Sequence of expectations of maximum-order statistics," Statistics & Probability Letters, Elsevier, vol. 38(2), pages 117-123, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nickos Papadatos, 1995. "Maximum variance of order statistics," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 47(1), pages 185-193, January.
    2. de la Cal, Jesús & Valle, Ana M., 2001. "Monotonicity properties of certain expected extreme order statistics," Statistics & Probability Letters, Elsevier, vol. 52(3), pages 313-319, April.
    3. Huang, J. S., 1998. "Sequence of expectations of maximum-order statistics," Statistics & Probability Letters, Elsevier, vol. 38(2), pages 117-123, June.
    4. Eric Overby & Karthik Kannan, 2015. "How Reduced Search Costs and the Distribution of Bidder Participation Affect Auction Prices," Management Science, INFORMS, vol. 61(6), pages 1398-1420, June.
    5. de la Cal, J. & Cárcamo, J., 2005. "Inequalities for expected extreme order statistics," Statistics & Probability Letters, Elsevier, vol. 73(3), pages 219-231, July.
    6. Balakrishnan, N. & Cramer, E. & Kamps, U., 2001. "Bounds for means and variances of progressive type II censored order statistics," Statistics & Probability Letters, Elsevier, vol. 54(3), pages 301-315, October.

    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:eee:stapro:v:47:y:2000:i:3:p:295-300. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    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.