Sampling via Rejection-Free Partial Neighbor Search

DOI10.1080/03610918.2023.2266157MaRDI QIDQ6969150zbMATH OpenFDO

Authors Sigeng Chen, Jeffrey S. Rosenthal, Aki Dote, Hirotaka Tamura, Ali Sheikholeslami

Publication date 23 June 2025

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Sampling theory, sample surveys (62D05)

Cites work

• scientific article; zbMATH DE number 5954252 (Why is no real title available?)
• A general decision theory for Huber's \(\epsilon\)-contamination model
• A note on Metropolis-Hastings kernels for general state spaces
• Equation of state calculations by fast computing machines
• Jump Markov chains and rejection-free Metropolis algorithms
• Monte Carlo sampling methods using Markov chains and their applications
• Optimization via rejection-free partial neighbor search
• Optimum Monte-Carlo sampling using Markov chains
• The Multiple-Try Method and Local Optimization in Metropolis Sampling
• The unconstrained binary quadratic programming problem: a survey
• Weighted random sampling with a reservoir
• Why the Monte Carlo method is so important today

This page was built for publication: Sampling via Rejection-Free Partial Neighbor Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969150)