Efficient Simulation of High Dimensional Gaussian Vectors
Published Online:6 Sep 2018https://doi.org/10.1287/moor.2017.0914
References
- (2013) Iterative numerical methods for sampling from high dimensional Gaussian distributions. Statist. Comput. 23(4):501–521.Crossref, Google Scholar
- (1993) Hit-and-run algorithms for generating multivariate distributions. Math. Oper. Res. 18(2):255–266.Link, Google Scholar
- (2016) A practical volume algorithm. Math. Programming Comput. 8(2):133–160.Crossref, Google Scholar
- (2015) Statistics for Spatial Data (John Wiley & Sons, New York).Google Scholar
- (2003) An introduction to MCMC. Spatial Statistics and Computational Methods (Springer, New York), 1–41.Crossref, Google Scholar
- (2009) The Markov chain Monte Carlo revolution. Bull. Amer. Math. Soc. 46(2):179–205.Crossref, Google Scholar
- (1997) Fast and exact simulation of stationary Gaussian processes through circulant embedding of the covariance matrix. SIAM J. Sci. Comput. 18(4):1088–1107.Crossref, Google Scholar
- (2007) Model-Based Geostatistics. Springer Series in Statistics (Springer, New York).Google Scholar
- (2003) An introduction to model-based geostatistics. Spatial Statistics and Computational Methods (Springer, New York), 43–86.Crossref, Google Scholar
- (1982) The Fréchet distance between multivariate normal distributions. J. Multivariate Anal. 12(3):450–455.Crossref, Google Scholar
- (2016) Sampling from strongly log-concave distributions with the unadjusted Langevin algorithm. arXiv preprint 1605.01559.Google Scholar
- (2011) Statistical Distributions, Fourth ed. (John Wiley & Sons, Hoboken, NJ).Google Scholar
- (2004) Calibrated probabilistic mesoscale weather field forecasting: The geostatistical output perturbation method. J. Amer. Statist. Assoc. 99(467):575–583.Crossref, Google Scholar
- (1998) A Chernoff bound for random walks on expander graphs. SIAM J. Comput. 27(4):1203–1220.Crossref, Google Scholar
- (2004) Monte Carlo Methods in Financial Engineering, vol. 53 (Springer, New York).Google Scholar
- (2013) Matrix Computations, Fourth ed. (JHU Press, Baltimore).Google Scholar
- (2012) Options, Futures and Other Derivatives, Eigth ed. (Pearson Education Limited, England)Google Scholar
- (1997) Large deviation bounds for Markov chains. Combinatorics, Probab. Comput. 6(4):465–474.Crossref, Google Scholar
- (1997) A semidefinite bound for mixing rates of Markov chains. Random Structures and Algorithms 11(4):299–313.Crossref, Google Scholar
- (1999) Hit-and-run mixes fast. Math. Programming 86(3):443–461.Crossref, Google Scholar
- (2006) Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization. 47th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS’06) (IEEE), 57–68.Google Scholar
- (2001) Fast sampling of Gaussian Markov random fields. J. Roy. Statist. Soc.: Ser. B (Statist. Methodology) 63(2):325–338.Crossref, Google Scholar
- (2014) Learning to optimize via posterior sampling. Math. Oper. Res. 39(4):1221–1243.Link, Google Scholar
- (2016) An information-theoretic analysis of Thompson sampling. J. Machine Learn. Res. 17(68):1–30.Google Scholar
- (1992) Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probab. Comput. 1(4):351–370.Crossref, Google Scholar
- (1984) Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32(6):1296–1308.Link, Google Scholar
- (2002) Fast and exact simulation of fractional Brownian surfaces. J. Comput. Graphical Statist. 11(3):587–599.Crossref, Google Scholar
- (2009) Optimal Transport: Old and New, vol. 338 (Springer-Verlag, Berlin, Heidelberg).Crossref, Google Scholar
- (1994) Simulation of stationary Gaussian processes in [0, 1]d. J. Comput. Graphical Statist. 3(4):409–432.Google Scholar

