Polya tree Monte Carlo method

DOI10.1016/j.csda.2022.107665OpenAlexW4310075640MaRDI QIDQ6167052

Haoxin Zhuang, Grace Y. Yi, Liqun Diao

Publication date: 7 July 2023

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2022.107665

zbMATH Keywords

Markov chain Monte CarloGibbs samplerMetropolis-Hasting algorithmpolya treessampling from a distribution

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites Work

• On adaptive Markov chain Monte Carlo algorithms
• Adaptive independent Metropolis-Hastings
• Polya trees and random distributions
• Some aspects of Pólya tree distributions for statistical modelling
• Discreteness of Ferguson selections
• Ferguson distributions via Polya urn schemes
• More aspects of Pólya tree distributions for statistical modelling
• Prior distributions on spaces of probability measures
• A framework for adaptive MCMC targeting multimodal distributions
• Finite mixture and Markov switching models.
• A Bayesian analysis of some nonparametric problems
• Adaptive Step Size Selection for Hessian-Based Manifold Langevin Samplers
• Inference for Mixtures of Finite Polya Tree Models
• Sampling-Based Approaches to Calculating Marginal Densities
• Handbook of Markov Chain Monte Carlo
• Modeling Regression Error With a Mixture of Polya Trees
• A nonparametric Bayesian approach to copula estimation
• On the Asymptotic Behavior of Bayes' Estimates in the Discrete Case
• A class of distribution function processes which have derivatives
• Monte Carlo sampling methods using Markov chains and their applications
• An adaptive Metropolis algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item