Pages that link to "Item:Q3214140"

The following pages link to Optimum Monte-Carlo sampling using Markov chains (Q3214140):

Displaying 37 items.

• Generating MCMC proposals by randomly rotating the regular simplex (Q2111065) (← links)
• From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains (Q2117444) (← links)
• On the theoretical properties of the exchange algorithm (Q2137050) (← links)
• Variance bounding of delayed-acceptance kernels (Q2157432) (← links)
• On multiple acceleration of reversible Markov chain (Q2170228) (← links)
• A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins (Q2180075) (← links)
• On hitting time, mixing time and geometric interpretations of Metropolis-Hastings reversiblizations (Q2181629) (← links)
• Importance sampling correction versus standard averages of reversible MCMCs in terms of the asymptotic variance (Q2196543) (← links)
• Markov chain Monte Carlo algorithms with sequential proposals (Q2209708) (← links)
• Informed reversible jump algorithms (Q2233560) (← links)
• On the flexibility of the design of multiple try Metropolis schemes (Q2259352) (← links)
• Metropolis-Hastings reversiblizations of non-reversible Markov chains (Q2289820) (← links)
• Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms (Q2341639) (← links)
• Minimising MCMC variance via diffusion limits, with an application to simulated tempering (Q2443188) (← links)
• On the spectral analysis of second-order Markov chains (Q2452089) (← links)
• Stationarity preserving and efficiency increasing probability mass transfers made possible (Q2463660) (← links)
• Up-and-down experiments of first and second order (Q2485984) (← links)
• Optimal acceptance rates for Metropolis algorithms: Moving beyond 0.234 (Q2518614) (← links)
• Accelerating reversible Markov chains (Q2637358) (← links)
• A theoretical framework for simulated annealing (Q2638941) (← links)
• Variational principles for asymptotic variance of general Markov processes (Q2690111) (← links)
• Correlation formulas for Markovian network processes in a random environment (Q2806352) (← links)
• On the Flexibility of Metropolis-Hastings Acceptance Probabilities in Auxiliary Variable Proposal Generation (Q2911670) (← links)
• Does Waste Recycling Really Improve the Multi-Proposal Metropolis–Hastings algorithm? an Analysis Based on Control Variates (Q3402050) (← links)
• Comparison of hit-and-run, slice sampler and random walk Metropolis (Q4611278) (← links)
• A Tutorial on Reversible Jump MCMC with a View toward Applications in QTL-mapping (Q4831989) (← links)
• Optimal Sampling for Simulated Annealing Under Noise (Q5131720) (← links)
• Convergence of Conditional Metropolis-Hastings Samplers (Q5169501) (← links)
• Searching for efficient Markov chain Monte Carlo proposal kernels (Q5170989) (← links)
• Control Variates for the Metropolis–Hastings Algorithm (Q5324876) (← links)
• Dependence ordering for Markov processes on partially ordered spaces (Q5754689) (← links)
• Conditional sequential Monte Carlo in high dimensions (Q6117026) (← links)
• Reducing rejection exponentially improves Markov chain Monte Carlo sampling (Q6140171) (← links)
• Dimension‐independent Markov chain Monte Carlo on the sphere (Q6140340) (← links)
• Determining the height of energy barriers of the cyclohexene molecule using stochastic approximation (Q6159056) (← links)
• Optimal scaling of MCMC beyond Metropolis (Q6159395) (← links)
• Singular relaxation of a random walk in a box with a Metropolis Monte Carlo dynamics (Q6162532) (← links)