Hit and run as a unifying device

MaRDI QIDQ2197359zbMATH OpenFDO

Authors Hans C. Andersen, Persi Diaconis

Publication date 31 August 2020

Published in Journal de la Société Française de Statistique \& Revue de Statistique Appliquée (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item/JSFS_2007__148_4_5_0

zbMATH Keywords

data augmentationauxiliary variablesMarkov chain Monte Carlo algorithmsBurnside processhit and runSwedsen-Wang algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to probability theory (60-08) Monte Carlo methods (65C05) Contingency tables (62H17) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• Convergence properties of hit–and–run samplers
• Comparison of hit-and-run, slice sampler and random walk Metropolis
• Hit-and-Run Algorithms for Generating Multivariate Distributions
• An analysis of a variation of hit-and-run for uniform sampling from general regions
• Positivity of hit-and-run and related algorithms

Cites work

• scientific article; zbMATH DE number 44579 (Why is no real title available?)
• scientific article; zbMATH DE number 472922 (Why is no real title available?)
• scientific article; zbMATH DE number 475376 (Why is no real title available?)
• scientific article; zbMATH DE number 1082719 (Why is no real title available?)
• scientific article; zbMATH DE number 2151247 (Why is no real title available?)
• scientific article; zbMATH DE number 2172364 (Why is no real title available?)
• scientific article; zbMATH DE number 795108 (Why is no real title available?)
• scientific article; zbMATH DE number 847276 (Why is no real title available?)
• scientific article; zbMATH DE number 3278887 (Why is no real title available?)
• A Theory of Statistical Models for Monte Carlo Integration
• Algebraic algorithms for sampling from conditional distributions
• Analysis of a Bose-Einstein Markov chain
• Analysis of a nonreversible Markov chain sampler.
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
• Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
• Billiards in a general domain with random reflections
• Convergence of Slice Sampler Markov Chains
• Convergence properties of hit–and–run samplers
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Estimation of a covariance matrix using the reference prior
• Gibbs Sampling for Bayesian Non-Conjugate and Hierarchical Models by Using Auxiliary Variables
• Gibbs sampling, exponential families and orthogonal polynomials
• Hit-and-Run Algorithms for Generating Multivariate Distributions
• Hit-and-Run from a Corner
• Hit-and-run mixes fast
• Monte Carlo methods in Bayesian computation
• Monte Carlo strategies in scientific computing
• NON-NULL RANKING MODELS. I
• Non-Existence of Everywhere Proper Conditional Distributions
• On a New Variant of the Monte Carlo Method
• On the Computation of Multidimensional Integrals by the Monte-Carlo Method
• Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
• Sequential Monte Carlo Methods for Statistical Analysis of Tables
• Slice sampling. (With discussions and rejoinder)
• Statistical problems involving permutations with restricted positions
• Stochastic alternating projections
• Systematic scan for sampling colorings
• Testing for independence in a two-way table: New interpretations of the chi-square statistic
• The Calculation of Posterior Distributions by Data Augmentation
• The Swendsen-Wang process does not always mix rapidly
• The statistical work of Lucien Le Cam.
• The ‘Burnside Process’ Converges Slowly
• Trivial intersection of \(\sigma \)-fields and Gibbs sampling
• What do we know about the product replacement algorithm?

Cited in

(26)

• Hit and run ARMS: adaptive rejection Metropolis sampling with hit and run random direction
• Poisson approximation for large permutation groups
• A non-local random walk on the hypercube
• Fast mixing of a randomized shift-register Markov chain
• Statistics of the two star ERGM
• Markov Bases: A 25 Year Update
• Sampling from p-adic algebraic manifolds
• Comparison of hit-and-run, slice sampler and random walk Metropolis
• Correction to: ``Speeding up Markov chains with deterministic jumps
• Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
• Pattern hit-and-run for sampling efficiently on polytopes
• Measuring exposure to dependence risk with random Bernstein copula scenarios
• Mixing times of a Burnside process Markov chain on set partitions
• Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
• New Stick Number Bounds from Random Sampling of Confined Polygons
• Direct sampling of confined polygons in linear time
• Mixing times for the commuting chain on CA groups
• Positivity of hit-and-run and related algorithms
• A generalization of the Solis-Wets method
• An algorithm for uniform generation of unlabeled (Pólya) trees
• Hahn polynomials and the Burnside process
• A Hit‐and‐Run approach for generating scale invariant Small World networks
• Accelerated convergence in Hit-and-Run Monte Carlo and a coordinate-free randomized Kaczmarz algorithm
• Semi-deterministic processes with applications in random billiards
• Speeding up Markov chains with deterministic jumps
• Random sampling of contingency tables and partitions: two practical examples of the Burnside process

This page was built for publication: Hit and run as a unifying device

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