On array-RQMC for Markov chains: Mapping alternatives and convergence rates
DOI10.1007/978-3-642-04107-5_31zbMATH Open1184.65018OpenAlexW2105345388MaRDI QIDQ3405461FDOQ3405461
Authors: Pierre L'Ecuyer, Christian Lécot, Adam L'Archevêque-Gaudet 
Publication date: 15 February 2010
Published in: Monte Carlo and Quasi-Monte Carlo Methods 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04107-5_31
Recommendations
- A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
- Sorting methods and convergence rates for Array-RQMC: some empirical comparisons
- Randomized quasi-Monte Carlo simulation of Markov chains with an ordered state space
- Quasi-Monte Carlo simulation of discrete time Markov chains on multidimensional state spaces
- Randomized quasi-Monte Carlo: an introduction for practitioners
convergencenumerical examplesdiscrepancyparallel computationdiscrete-time Markov chainsrandomized quasi-Monte Carlo method
Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)
Cited In (6)
- Multifidelity multilevel Monte Carlo to accelerate approximate Bayesian parameter inference for partially observed stochastic processes
- Sorting methods and convergence rates for Array-RQMC: some empirical comparisons
- Stratified Monte Carlo simulation of Markov chains
- Sudoku Latin Square Sampling for Markov Chain Simulation
- Randomized quasi-Monte Carlo simulation of Markov chains with an ordered state space
- Variance reduction with array-RQMC for tau-leaping simulation of stochastic biological and chemical reaction networks
This page was built for publication: On array-RQMC for Markov chains: Mapping alternatives and convergence rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405461)
