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

Computing Probabilities of Finding Extremes in a Random Set

Author

Listed:
  • Gheorghiţă Zbăganu

    (Institute of Mathematical Statistics and Applied Mathematics, “Gh. Mihoc-C. Iacob” Romanian Academy, 050711 Bucharest, Romania)

  • Anişoara Maria Răducan

    (Institute of Mathematical Statistics and Applied Mathematics, “Gh. Mihoc-C. Iacob” Romanian Academy, 050711 Bucharest, Romania
    Department of Applied Mathematics, Faculty of Cybernetics, Statistics and Economic Informatics, University of Economic Studies of Bucharest, Calea Dorobanti, No. 15-17, Sector 1, 010552 Bucharest, Romania)

  • Marius Rădulescu

    (Institute of Mathematical Statistics and Applied Mathematics, “Gh. Mihoc-C. Iacob” Romanian Academy, 050711 Bucharest, Romania)

Abstract

This study examines the occurrence of extreme points in random samples of size n obtained by mapping uniformly distributed random variables through a function into a multidimensional space. We focus on the probabilities that such sets contain a unique componentwise maximum, minimum, or both. Our interest lies in the asymptotic behavior of these probabilities. We found that in some cases, for certain irregular mappings, the limits of these probabilities may fail to exist as n tends to infinity. This contrasts with our earlier work, where the assumptions of smoothness and regularity of the mapping function ensured well-behaved limits. In the present study, we investigate scenarios in which these smoothness conditions are relaxed or absent. Because the general multidimensional case is highly challenging, we restrict attention to a simpler but illustrative setting: finite random sets in the plane that lie on the graph of a real function defined over the unit interval. We present partial results in this setting and discuss open questions that remain for future research.

Suggested Citation

  • Gheorghiţă Zbăganu & Anişoara Maria Răducan & Marius Rădulescu, 2025. "Computing Probabilities of Finding Extremes in a Random Set," Mathematics, MDPI, vol. 13(19), pages 1-22, September.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:19:p:3074-:d:1757295
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/19/3074/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/19/3074/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:gam:jmathe:v:13:y:2025:i:19:p:3074-:d:1757295. 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.