@article{2010shipas,
	author = {K. Shin and R. Pasupathy},
	title = {A method for fast generation of {P}oisson random vectors},
	journal = {INFORMS Journal on Computing},
	year = {2010},
	volume = {22},
	number = {1},
	pages = {81--92},
	doi = {10.1287/ijoc.1090.0332},
	keywords = {random variate generation},
	abstract = {We present the ``trivariate reduction extension'' (TREx)?an exact algorithm for the fast generation of bivariate Poisson random vectors. Like the normal-to-anything (NORTA) procedure, TREx has two phases: a preprocessing phase when the required algorithm parameters are identified, and a generation phase when the parameters identified during the preprocessing phase are used to generate the desired Poisson vector. We prove that the proposed algorithm covers the entire range of theoretically feasible correlations, and we provide efficient-computation directives and rigorous bounds for truncation error control. We demonstrate through extensive numerical tests that TREx, being a specialized algorithm for Poisson vectors, has a preprocessing phase that is uniformly a hundred to a thousand times faster than a fast implementation of NORTA. The generation phases of TREx and NORTA are comparable in speed, with that of TREx being marginally faster. All code is publicly available.}}

{"_id":"Pdh44ASYBjTrHJRMQ","bibbaseid":"shin-pasupathy-amethodforfastgenerationofpoissonrandomvectors-2010","author_short":["Shin, K.","Pasupathy, R."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["K."],"propositions":[],"lastnames":["Shin"],"suffixes":[]},{"firstnames":["R."],"propositions":[],"lastnames":["Pasupathy"],"suffixes":[]}],"title":"A method for fast generation of Poisson random vectors","journal":"INFORMS Journal on Computing","year":"2010","volume":"22","number":"1","pages":"81–92","doi":"10.1287/ijoc.1090.0332","keywords":"random variate generation","abstract":"We present the ``trivariate reduction extension'' (TREx)?an exact algorithm for the fast generation of bivariate Poisson random vectors. Like the normal-to-anything (NORTA) procedure, TREx has two phases: a preprocessing phase when the required algorithm parameters are identified, and a generation phase when the parameters identified during the preprocessing phase are used to generate the desired Poisson vector. We prove that the proposed algorithm covers the entire range of theoretically feasible correlations, and we provide efficient-computation directives and rigorous bounds for truncation error control. We demonstrate through extensive numerical tests that TREx, being a specialized algorithm for Poisson vectors, has a preprocessing phase that is uniformly a hundred to a thousand times faster than a fast implementation of NORTA. The generation phases of TREx and NORTA are comparable in speed, with that of TREx being marginally faster. All code is publicly available.","bibtex":"@article{2010shipas,\n\tauthor = {K. Shin and R. Pasupathy},\n\ttitle = {A method for fast generation of {P}oisson random vectors},\n\tjournal = {INFORMS Journal on Computing},\n\tyear = {2010},\n\tvolume = {22},\n\tnumber = {1},\n\tpages = {81--92},\n\tdoi = {10.1287/ijoc.1090.0332},\n\tkeywords = {random variate generation},\n\tabstract = {We present the ``trivariate reduction extension'' (TREx)?an exact algorithm for the fast generation of bivariate Poisson random vectors. Like the normal-to-anything (NORTA) procedure, TREx has two phases: a preprocessing phase when the required algorithm parameters are identified, and a generation phase when the parameters identified during the preprocessing phase are used to generate the desired Poisson vector. We prove that the proposed algorithm covers the entire range of theoretically feasible correlations, and we provide efficient-computation directives and rigorous bounds for truncation error control. We demonstrate through extensive numerical tests that TREx, being a specialized algorithm for Poisson vectors, has a preprocessing phase that is uniformly a hundred to a thousand times faster than a fast implementation of NORTA. The generation phases of TREx and NORTA are comparable in speed, with that of TREx being marginally faster. All code is publicly available.}}\n\n","author_short":["Shin, K.","Pasupathy, R."],"key":"2010shipas","id":"2010shipas","bibbaseid":"shin-pasupathy-amethodforfastgenerationofpoissonrandomvectors-2010","role":"author","urls":{},"keyword":["random variate generation"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"article","biburl":"web.ics.purdue.edu/~pasupath/rpVitapublist.bib","dataSources":["Q4TNB6PfH2Ne5F2fj"],"keywords":["random variate generation"],"search_terms":["method","fast","generation","poisson","random","vectors","shin","pasupathy"],"title":"A method for fast generation of Poisson random vectors","year":2010}