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

Critical Analysis of Beta Random Variable Generation Methods

Author

Listed:
  • Elena Almaraz Luengo

    (Department of Statistics and Operational Research, Faculty of Mathematical Science, Complutense University of Madrid, 28040 Madrid, Spain)

  • Carlos Gragera

    (Faculty of Mathematical Science, Complutense University of Madrid, 28040 Madrid, Spain)

Abstract

The fast generation of values of the beta random variable is a subject of great interest and multiple applications, ranging from purely mathematical and statistical ones to applications in management and production, among others. There are several methods for generating these values, with one of the essential points for their design being the selection of random seeds. Two interesting aspects converge here: the use of sequences as inputs (and the need for them to verify properties such as randomness and uniformity, which are verified through statistical test suites) and the design of the algorithm for the generation of the variable. In this paper, we analyse, in detail, the algorithms that have been developed in the literature, both from a mathematical/statistical and computational point of view. We also provide empirical development using R software, which is currently in high demand and is one of the main novelties with respect to previous comparisons carried out in FORTRAN. We establish which algorithms are more efficient and in which contexts, depending on the different values of the parameters, allowing the user to determine the best method given the experimental conditions.

Suggested Citation

  • Elena Almaraz Luengo & Carlos Gragera, 2023. "Critical Analysis of Beta Random Variable Generation Methods," Mathematics, MDPI, vol. 11(24), pages 1-31, December.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:24:p:4893-:d:1295312
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/24/4893/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/24/4893/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ovidiu Bagdasar & Minsi Chen & Vasile Drăgan & Ivan Ganchev Ivanov & Ioan-Lucian Popa, 2023. "On Horadam Sequences with Dense Orbits and Pseudo-Random Number Generators," Mathematics, MDPI, vol. 11(5), pages 1-16, March.
    2. Shenli Zhu & Xiaoheng Deng & Wendong Zhang & Congxu Zhu, 2023. "Construction of a New 2D Hyperchaotic Map with Application in Efficient Pseudo-Random Number Generator Design and Color Image Encryption," Mathematics, MDPI, vol. 11(14), pages 1-23, July.
    3. D. G. Malcolm & J. H. Roseboom & C. E. Clark & W. Fazar, 1959. "Application of a Technique for Research and Development Program Evaluation," Operations Research, INFORMS, vol. 7(5), pages 646-669, October.
    4. Bruce W. Schmeiser, 1980. "Technical Note—Generation of Variates from Distribution Tails," Operations Research, INFORMS, vol. 28(4), pages 1012-1017, August.
    5. Dennis Ridley & Pierre Ngnepieba, 2023. "Antithetic Power Transformation in Monte Carlo Simulation: Correcting Hidden Errors in the Response Variable," Mathematics, MDPI, vol. 11(9), pages 1-12, April.
    6. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    7. Bruce W. Schmeiser & A. J. G. Babu, 1980. "Beta Variate Generation via Exponential Majorizing Functions," Operations Research, INFORMS, vol. 28(4), pages 917-926, August.
    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. Laslo, Zohar & Keren, Baruch & Ilani, Hagai, 2008. "Minimizing task completion time with the execution set method," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1513-1519, June.
    2. Geng, Sunyue & Liu, Sifeng & Fang, Zhigeng & Gao, Su, 2021. "A reliable framework for satellite networks achieving energy requirements," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    3. Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "An Approach to Realizing Process Control for Underground Mining Operations of Mobile Machines," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-17, June.
    4. Hermans, Ben & Leus, Roel & Looy, Bart Van, 2023. "Deciding on scheduling, secrecy, and patenting during the new product development process: The relevance of project planning models," Omega, Elsevier, vol. 116(C).
    5. Agrawal, M. K. & Elmaghraby, S. E. & Herroelen, W. S., 1996. ": A generator of testsets for project activity nets," European Journal of Operational Research, Elsevier, vol. 90(2), pages 376-382, April.
    6. Trietsch, Dan & Mazmanyan, Lilit & Gevorgyan, Lilit & Baker, Kenneth R., 2012. "Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation," European Journal of Operational Research, Elsevier, vol. 216(2), pages 386-396.
    7. Hajdu M. & Isaac S., 2016. "Sixty years of project planning: history and future," Organization, Technology and Management in Construction, Sciendo, vol. 8(1), pages 1499-1510, December.
    8. Gerald G. Brown & W. Matthew Carlyle & Robert C. Harney & Eric M. Skroch & R. Kevin Wood, 2009. "Interdicting a Nuclear-Weapons Project," Operations Research, INFORMS, vol. 57(4), pages 866-877, August.
    9. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    10. Zhao, Mingxuan & Zhou, Jian & Wang, Ke & Pantelous, Athanasios A., 2023. "Project scheduling problem with fuzzy activity durations: A novel operational law based solution framework," European Journal of Operational Research, Elsevier, vol. 306(2), pages 519-534.
    11. Laslo, Zohar & Gurevich, Gregory, 2007. "Minimal budget for activities chain with chance constrained lead-time," International Journal of Production Economics, Elsevier, vol. 107(1), pages 164-172, May.
    12. Jorgensen, Trond & Wallace, Stein W., 2000. "Improving project cost estimation by taking into account managerial flexibility," European Journal of Operational Research, Elsevier, vol. 127(2), pages 239-251, December.
    13. Yakhchali, Siamak Haji & Ghodsypour, Seyed Hassan, 2010. "Computing latest starting times of activities in interval-valued networks with minimal time lags," European Journal of Operational Research, Elsevier, vol. 200(3), pages 874-880, February.
    14. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    15. Kamburowski, J., 1997. "New validations of PERT times," Omega, Elsevier, vol. 25(3), pages 323-328, June.
    16. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    17. Rostami, Salim & Creemers, Stefan & Leus, Roel, 2024. "Maximizing the net present value of a project under uncertainty: Activity delays and dynamic policies," European Journal of Operational Research, Elsevier, vol. 317(1), pages 16-24.
    18. Nima Zoraghi & Aria Shahsavar & Babak Abbasi & Vincent Peteghem, 2017. "Multi-mode resource-constrained project scheduling problem with material ordering under bonus–penalty policies," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 49-79, April.
    19. Pérez, José García & Martín, María del Mar López & García, Catalina García & Sánchez Granero, Miguel Ángel, 2016. "Project management under uncertainty beyond beta: The generalized bicubic distribution," Operations Research Perspectives, Elsevier, vol. 3(C), pages 67-76.
    20. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:11:y:2023:i:24:p:4893-:d:1295312. 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: 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.