IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i10p1623-d812298.html
   My bibliography  Save this article

On the Probability of Finding Extremes in a Random Set

Author

Listed:
  • Anișoara Maria Răducan

    (“Gheorghe Mihoc-Caius Iacob” Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania
    Department of Applied Mathematics, Bucharest University of Economic Studies, 010522 Bucharest, Romania)

  • Constanța Zoie Rădulescu

    (National Institute for Research and Development in Informatics, 011455 Bucharest, Romania)

  • Marius Rădulescu

    (“Gheorghe Mihoc-Caius Iacob” Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania)

  • Gheorghiță Zbăganu

    (“Gheorghe Mihoc-Caius Iacob” Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania)

Abstract

We consider a sequence Z j j ≥ 1 of i.i.d. d -dimensional random vectors and for every n ≥ 1 consider the sample S n = { Z 1 , Z 2 , … , Z n } . We say that Z j is a “leader” in the sample S n if Z j ≥ Z k , ∀ k ∈ { 1 , 2 , … , n } and Z j is an “anti-leader” if Z j ≤ Z k , ∀ k ∈ { 1 , 2 , … , n } . After all, the leader and the anti-leader are the naive extremes. Let a n be the probability that S n has a leader, b n be the probability that S n has an anti-leader and c n be the probability that S n has both a leader and an anti-leader. One of the aims of the paper is to compute, or, at least to estimate, or if even that is not possible, to estimate the limits of this quantities. Another goal is to find conditions on the distribution F of Z j j ≥ 1 so that the inferior limits of a n , b n , c n are positive. We give examples of distributions for which we can compute these probabilities and also examples when we are not able to do that. Then we establish conditions, unfortunately only sufficient when the limits are positive. Doing that we discovered a lot of open questions and we make two annoying conjectures—annoying because they seemed to be obvious but at a second thought we were not able to prove them. It seems that these problems have never been approached in the literature.

Suggested Citation

  • Anișoara Maria Răducan & Constanța Zoie Rădulescu & Marius Rădulescu & Gheorghiță Zbăganu, 2022. "On the Probability of Finding Extremes in a Random Set," Mathematics, MDPI, vol. 10(10), pages 1-24, May.
  • Handle: RePEc:gam:jmathe:v:10:y:2022:i:10:p:1623-:d:812298
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/10/1623/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/10/10/1623/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:10:y:2022:i:10:p:1623-:d:812298. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.