Fixed Precision MCMC Estimation by Median of Products of Averages
From MaRDI portal
Publication:5321751
DOI10.1239/jap/1245676089zbMath1170.60327OpenAlexW2065635210WikidataQ96748981 ScholiaQ96748981MaRDI QIDQ5321751
Piotr Pokarowski, Wojciech Niemiro
Publication date: 15 July 2009
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1245676089
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Information geometry approach to parameter estimation in Markov chains ⋮ Nonasymptotic Bounds on the Mean Square Error for MCMC Estimates via Renewal Techniques ⋮ Dimension-Independent MCMC Sampling for Inverse Problems with Non-Gaussian Priors ⋮ Rigorous confidence bounds for MCMC under a geometric drift condition ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ Consistency of randomized integration methods ⋮ Efficient Monte Carlo for high excursions of Gaussian random fields ⋮ Nonasymptotic bounds on the estimation error of MCMC algorithms ⋮ The worm process for the Ising model is rapidly mixing ⋮ Normalizing constants of log-concave densities ⋮ Solvable integration problems and optimal sample size selection ⋮ Error bounds for computing the expectation by Markov chain Monte Carlo ⋮ Optimal confidence for Monte Carlo integration of smooth functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Geometric bounds for eigenvalues of Markov chains
- Random generation of combinatorial structures from a uniform distribution
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Chernoff-type bound for finite Markov chains
- Analysis of a nonreversible Markov chain sampler.
- A probability inequality for the occupation measure of a reversible Markov chain
- Systematic scan for sampling colorings
- Stochastic simulation: Algorithms and analysis
- On the efficiency of the Asmussen-Kroese-estimator and its application to stop-loss transforms
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Polynomial-Time Approximation Algorithms for the Ising Model
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
- Matrix Analysis
- A Chernoff Bound for Random Walks on Expander Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Improved algorithms for rare event simulation with heavy tails
This page was built for publication: Fixed Precision MCMC Estimation by Median of Products of Averages