Delayed rejection in reversible jump Metropolis-Hastings
From MaRDI portal
Publication:2773183
DOI10.1093/biomet/88.4.1035zbMath1099.60508OpenAlexW2114350394MaRDI QIDQ2773183
Antonietta Mira, Peter J. Green
Publication date: 2001
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/88.4.1035
Markov processes: estimation; hidden Markov models (62M05) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05)
Related Items
Markov chain Monte Carlo fitting of single-channel data from inositol trisphosphate receptors, A generalized mixture model applied to diabetes incidence data, A generalized multiple-try version of the reversible jump algorithm, On the Flexibility of Metropolis-Hastings Acceptance Probabilities in Auxiliary Variable Proposal Generation, Nonparametric Bayesian topic modelling with the hierarchical Pitman-Yor processes, Low-rank separated representation surrogates of high-dimensional stochastic functions: application in Bayesian inference, Using hierarchical centering to facilitate a reversible jump MCMC algorithm for random effects models, A transdimensional Bayesian approach to ultrasonic travel-time tomography for non-destructive testing, A simulation smoother for long memory time series with correlated and heteroskedastic additive noise, Ensemble Inference Methods for Models With Noisy and Expensive Likelihoods, Bayesian joint-quantile regression, Bayesian inversion for unified ductile phase-field fracture, Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization, Bayesian inversion for electrical-impedance tomography in medical imaging using the nonlinear Poisson-Boltzmann equation, Likelihood-free parallel tempering, MCMC methods for inference in a mathematical model of pulmonary circulation, Equation-solving estimator based on the general n-step MHDR algorithm, Zero variance differential geometric Markov chain Monte Carlo algorithms, Parallel hierarchical sampling: a general-purpose interacting Markov chains Monte Carlo algorithm, Slice sampling. (With discussions and rejoinder), Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo, Markov chain Monte Carlo algorithms with sequential proposals, Random Sampling from Joint Probability Distributions Defined in a Bayesian Framework, Ordering and improving the performance of Monte Carlo Markov chains., Bayesian estimation for a mixture of simplex distributions with an unknown number of components: HDI analysis in Brazil, Bayes and empirical Bayes semi-blind deconvolution using eigenfunctions of a prior covariance, X-TMCMC: adaptive kriging for Bayesian inverse modeling, Stationarity preserving and efficiency increasing probability mass transfers made possible, Bayesian inversion for anisotropic hydraulic phase-field fracture, Latent marked Poisson process with applications to object segmentation, A Bayesian HMM with random effects and an unknown number of states for DNA copy number analysis, Improving the acceptance rate of reversible jump MCMC proposals, Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions, Zero variance Markov chain Monte Carlo for Bayesian estimators, Statistical Methods in Imaging, Extra chance generalized hybrid Monte Carlo, Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks, Scaling analysis of delayed rejection MCMC methods, Bayesian mixture modelling in geochronology via Markov chain Monte Carlo, Parallel tempering with equi-energy moves, Data-driven forward discretizations for Bayesian inversion, Multiset Model Selection, Geometric integrators and the Hamiltonian Monte Carlo method, Semiparametric multivariate and multiple change-point modeling, Effective grain orientation mapping of complex and locally anisotropic media for improved imaging in ultrasonic non-destructive testing, A simple model‐based approach to variable selection in classification and clustering, On the empirical efficiency of local MCMC algorithms with pools of proposals