scientific article; zbMATH DE number 1545677

DOI<link itemprop=identifier href="https://doi.org/10.1002/1098-2418(200010/12)17:3/4<290::AID-RSA6>3.0.CO;2-Q" /><290::AID-RSA6>3.0.CO;2-Q 10.1002/1098-2418(200010/12)17:3/4<290::AID-RSA6>3.0.CO;2-QzbMath1122.60310arXivmath/0105252MaRDI QIDQ4521550

Duncan J. Murdoch, Motoya Machida, Jeffrey S. Rosenthal, James Allen Fill

Publication date: 19 December 2000

Full work available at URL: https://arxiv.org/abs/math/0105252

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov chain Monte Carlopartially ordered settime reversalPolish spaceexact samplingtoursrejection samplingcoupling from the pastiterated random functionsstochastic monotonicitystandard Borel spaceperfect samplingrealizable monotonicityinterruptibilityFill's algorithmdetection processbounding processread-once coupling from the pastcoalescence, imputationmonotone transition rule

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (21)

Perfect sampling using bounding chains. ⋮ Fast perfect sampling from linear extensions ⋮ On the simulation of Markov chain steady-state distribution using CFTP algorithm ⋮ Multiprocess parallel antithetic coupling for backward and forward Markov chain Monte Carlo ⋮ A Guide to Exact Simulation ⋮ Comparison inequalities and fastest-mixing Markov chains ⋮ Polynomial time approximate or perfect samplers for discretized Dirichlet distribution ⋮ Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings ⋮ Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers ⋮ Strong stationary duality for diffusion processes ⋮ Rejection- and importance-sampling-based perfect simulation for Gibbs hard-sphere models ⋮ SMALL AND PSEUDO-SMALL SETS FOR MARKOV CHAINS ⋮ Monotone bivariate Markov kernels with specified marginals ⋮ Perfect Simulation for Image Restoration ⋮ Efficiency test of pseudorandom number generators using random walks ⋮ A kind of dual form for coupling from the past algorithm, to sample from Markov chain steady-state probability ⋮ Perfect simulation for marked point processes ⋮ Perfect Forward Simulation via Simulated Tempering ⋮ Using a Markov Chain to Construct a Tractable Approximation of an Intractable Probability Distribution ⋮ Perfect simulation for interacting point processes, loss networks and Ising models. ⋮ Dynamic Sampling from Graphical Models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong stationary times via a new form of duality
• Stochastic inequalities on partially ordered spaces
• An interruptible algorithm for perfect sampling via Markov chains
• Random walks and hyperplane arrangements
• Computable bounds for geometric convergence rates of Markov chains
• On the Markov chain for the move-to-root rule for binary search trees
• Rates of convergence for the move-to-root Markov chain for binary search trees
• Markov chains for exploring posterior distributions. (With discussion)
• A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• Perfect Simulation of Conditionally Specified Models
• Exact Sampling from a Continuous State Space
• Iterated Random Functions
• Exact sampling from anti‐monotone systems
• Perfect simulation and backward coupling^∗
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Extensions of Fill's Algorithm for Perfect Simulation
• How to couple from the past using a read-once source of randomness
• The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms
• On Exact Simulation of Markov Random Fields Using Coupling from the Past
• Pole and zero assignment by proportional feedback

This page was built for publication: