An improved exact sampling algorithm for the standard normal distribution
Yusong Du (),
Baoying Fan and
Baodian Wei ()
Additional contact information
Yusong Du: Sun Yat-sen University
Baoying Fan: Sun Yat-sen University
Baodian Wei: Sun Yat-sen University
Computational Statistics, 2022, vol. 37, issue 2, No 8, 737 pages
Abstract:
Abstract In 2016, Karney proposed an exact sampling algorithm for the standard normal distribution. In this paper, we study the computational complexity of this algorithm under the random deviate model. Specifically, Karney’s algorithm requires the access to an infinite sequence of independently and uniformly random deviates over the range (0, 1). We give a theoretical estimate of the expected number of uniform deviates used by this algorithm until it completes, and present an improved algorithm with lower uniform deviate consumption. The experimental results also shows that our improved algorithm has better performance than Karney’s algorithm.
Keywords: Random number generation; Rejection sampling; Discrete Gaussian distribution (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s00180-021-01136-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:compst:v:37:y:2022:i:2:d:10.1007_s00180-021-01136-w
Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/180/PS2
DOI: 10.1007/s00180-021-01136-w
Access Statistics for this article
Computational Statistics is currently edited by Wataru Sakamoto, Ricardo Cao and Jürgen Symanzik
More articles in Computational Statistics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().