Analysis of a nonreversible Markov chain sampler.
From MaRDI portal
Publication:1872496
DOI10.1214/aoap/1019487508zbMath1083.60516OpenAlexW2090251478WikidataQ58803823 ScholiaQ58803823MaRDI QIDQ1872496
Radford M. Neal, Persi Diaconis, Susan P. Holmes
Publication date: 6 May 2003
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aoap/1019487508
Monte Carlo methods (65C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items
Fast mixing of a randomized shift-register Markov chain, Exactly scale-free scale-free networks, Sparse hard-disk packings and local Markov chains, Chernoff and Berry–Esséen inequalities for Markov processes, Piecewise deterministic Markov processes for continuous-time Monte Carlo, Direction-sweep Markov chains, Variance reduction using nonreversible Langevin samplers, On the asymptotic variance of reversible Markov chain without cycles, Piecewise deterministic Markov processes for scalable Monte Carlo on restricted domains, Accelerating reversible Markov chains, Improving the convergence of reversible samplers, Complexity of zigzag sampling algorithm for strongly log-concave distributions, Nonreversible Jump Algorithms for Bayesian Nested Model Selection, Forward Event-Chain Monte Carlo: Fast Sampling by Randomness Control in Irreversible Markov Chains, Markov chain Monte Carlo and irreversibility, Non-reversible Metropolis-Hastings, Fixed Precision MCMC Estimation by Median of Products of Averages, Coupling and convergence for Hamiltonian Monte Carlo, Geometric ergodicity of the bouncy particle sampler, On multiple acceleration of reversible Markov chain, Some things we've learned (about Markov chain Monte Carlo), Acceleration of convergence to equilibrium in Markov chains by breaking detailed balance, Optimal Variance Reduction for Markov Chain Monte Carlo, On hitting time, mixing time and geometric interpretations of Metropolis-Hastings reversiblizations, On Sampling Simple Paths in Planar Graphs According to Their Lengths, Geometric ergodicity and the spectral gap of non-reversible Markov chains, Constructing optimal transition matrix for Markov chain Monte Carlo, Analysis of a non-reversible Markov chain speedup by a single edge, Non-reversible guided Metropolis kernel, A large deviation principle for the empirical measures of Metropolis-Hastings chains, Improved estimation of relaxation time in nonreversible Markov chains, Zero variance differential geometric Markov chain Monte Carlo algorithms, Speed up Zig-Zag, Optimal scaling of the MALA algorithm with irreversible proposals for Gaussian targets, Hit and run as a unifying device, Concave-Convex PDMP-based Sampling, Reversible Jump PDMP Samplers for Variable Selection, Using Bernoulli maps to accelerate mixing of a random walk on the torus, Using Markov transition matrices to generate trial configurations in Markov chain Monte Carlo simulations, PDMP characterisation of event-chain Monte Carlo algorithms for particle systems, Slice sampling. (With discussions and rejoinder), Optimal tuning of the hybrid Monte Carlo algorithm, Exact solution of two interacting run-and-tumble random walkers with finite tumble duration, Speeding up Markov chains with deterministic jumps, On the convergence time of some non-reversible Markov chain Monte Carlo methods, Ordering and improving the performance of Monte Carlo Markov chains., On the spectral analysis of second-order Markov chains, Variance bounding Markov chains, Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler, Stationarity preserving and efficiency increasing probability mass transfers made possible, Improved mixing rates of directed cycles by added connection, Random walks on rings and modules, Algorithms for improving efficiency of discrete Markov chains, Large deviations for the skew-detailed-balance lifted-Markov processes to sample the equilibrium distribution of the Curie–Weiss model, Connections and Extensions: A Discussion of the Paper by Girolami and Byrne, Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions, Zero variance Markov chain Monte Carlo for Bayesian estimators, Kinetic walks for sampling, Non-reversible Monte Carlo simulations of spin models, Markov chain mixing time on cycles, Efficiency of finite state space Monte Carlo Markov chains, On some mixing times for nonreversible finite Markov chains, Characterizing limits and opportunities in speeding up Markov chain mixing, A function space HMC algorithm with second order Langevin diffusion limit, Particle Metropolis-Hastings using gradient and Hessian information, Introduction to ``On the use of Markov chain Monte Carlo methods for the sampling of mixture models by R. Douc, F. Maire, J. Olsson, Hypocoercive relaxation to equilibrium for some kinetic models, Metropolis-Hastings reversiblizations of non-reversible Markov chains, Bounds on lifting continuous-state Markov chains to speed up mixing, Asymptotic optimality of isoperimetric constants, Correction to: ``Speeding up Markov chains with deterministic jumps, Peskun-Tierney ordering for Markovian Monte Carlo: beyond the reversible scenario, A piecewise deterministic Monte Carlo method for diffusion bridges, Geometric integrators and the Hamiltonian Monte Carlo method, Large deviations for the empirical measure of the zig-zag process, Geometry-informed irreversible perturbations for accelerated convergence of Langevin dynamics, Irreversible samplers from jump and continuous Markov processes, Ergodicity of the zigzag process, Exact spectral solution of two interacting run-and-tumble particles on a ring lattice, A note on the polynomial ergodicity of the one-dimensional Zig-Zag process, Mixing times for the commuting chain on CA groups
Cites Work
- Strong stationary times via a new form of duality
- What do we know about the Metropolis algorithm?
- Moderate growth and random walk on finite groups
- Algebraic algorithms for sampling from conditional distributions
- Nonparametric hierarchical Bayes via sequential imputations
- Gray codes for reflection groups
- Markov chains for exploring posterior distributions. (With discussion)
- Bayesian learning for neural networks
- Lifting Markov chains to speed up mixing
- Sampling-Based Approaches to Calculating Marginal Densities
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Large Hierarchical Bayesian Analysis of Multivariate Survival Data
- On sampling with Markov chains
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
