Fast simulation of truncated Gaussian distributions

From MaRDI portal
Publication:692973

DOI10.1007/S11222-009-9168-1zbMATH Open1284.65015DBLPjournals/sac/Chopin11arXiv1201.6140OpenAlexW2051378923WikidataQ59411863 ScholiaQ59411863MaRDI QIDQ692973FDOQ692973

Nicolas Chopin

Publication date: 6 December 2012

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: We consider the problem of simulating a Gaussian vector X, conditional on the fact that each component of X belongs to a finite interval [a_i,b_i], or a semi-finite interval [a_i,+infty). In the one-dimensional case, we design a table-based algorithm that is computationally faster than alternative algorithms. In the two-dimensional case, we design an accept-reject algorithm. According to our calculations and our numerical studies, the acceptance rate of this algorithm is bounded from below by 0.5 for semi-finite truncation intervals, and by 0.47 for finite intervals. Extension to 3 or more dimensions is discussed.


Full work available at URL: https://arxiv.org/abs/1201.6140




Recommendations




Cites Work


Cited In (30)

Uses Software





This page was built for publication: Fast simulation of truncated Gaussian distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692973)