An interruptible algorithm for perfect sampling via Markov chains
Open Access
- 1 February 1998
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 8 (1)
- https://doi.org/10.1214/aoap/1027961037
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- The Move-to-Front Rule: A Case Study for two Perfect Sampling AlgorithmsProbability in the Engineering and Informational Sciences, 1998
- Simulating the Invariant Measures of Markov Chains Using Backward Coupling at Regeneration TimesProbability in the Engineering and Informational Sciences, 1998
- How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed GraphJournal of Algorithms, 1998
- Bayesian Computation and Stochastic SystemsStatistical Science, 1995
- Two ergodicity criteria for stochastically recursive sequencesActa Applicandae Mathematicae, 1994
- Stationarity detection in the initial transient problemACM Transactions on Modeling and Computer Simulation, 1992
- Sequential Monte Carlo p-valuesBiometrika, 1991
- Shuffling Cards and Stopping TimesThe American Mathematical Monthly, 1986
- The Existence of Probability Measures with Given MarginalsThe Annals of Mathematical Statistics, 1965
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928