James Allen Fill
- 1.Aldous, D. and Diaconis, P. (1986). Shuffling cards and stopping times. Arner. Math. Monthly 93 333-348.Google Scholar
Cross Ref
- 2.Aldous, D. and Diacoms, P. (1987). Strong uniform times and finite random walks. Advances in Appl. Math. 8 69-97. Google ScholarDigital Library
- 3.Aldous, D. and Fill, J. A. (1996). Reversible Markov Chains and Random Walks on Graphs. Book in preparation. First draft of manuscript available via http://~, star. berkeley, edu/usrrs/aldous.Google Scholar
- 4.Asmussen, S., Glynn, P. W., and Thoriason, H. (1992). Stationary detection in the initial transient problem. A CM Thins. Modelling and Computer Sire. 2 130-157. Google ScholarDigital Library
- 5.Besag, J. E. (1986). On the statistical analysis of dirty pictures. J. Royal Statist. $oc. B 48 259-302.Google Scholar
- 6.Besag, J. E. and Clifford, P. (1989). Generalized Monte Carlo significance tests. Biometrika 76 633-642.Google ScholarCross Ref
- 7.Besag, J. E. and Clifford, P. (1991). Sequential Monte Carlo p-values. Biometrika 78 301-304.Google ScholarCross Ref
- 8.Besag, J., Green, P., Higdon, D., and Mengersen, K. (1995). Bayesian computation and stochastic systems. Statistical Science 10 3-66.Google ScholarCross Ref
- 9.Borovkov, A. A. and Foss, S. G. (1992). Stochastically recursive sequences and their generalizations. Siberian Adv. Math. 2 16--81.Google Scholar
- 10.Borovkov, A. A. and Foss, S. G. (1994). Two ergodicity criteria for stochastically recursive sequences. Acta Applic. Math. 34 125-134.Google ScholarCross Ref
- 11.Diaconis, P. (1988). Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, California.Google Scholar
- 12.Diaconis, P. and Fill, J. A. (1990). Strong stationary times via a new form of duality. Ann. Probab. 18 1483- 1522.Google Scholar
- 13.Diaconis, P. and Saloff-Coste, L. (1995). What do we know about the Metropolis algorithm? In Symposium on the Theory of Computing, 112-129. Google ScholarDigital Library
- 14.Diaconis, P. and Saloff-Coste, L. (1995). Geometry and randomness. Unpublished lecture notes.Google Scholar
- 15.Fill, J. A. (1996). The move-to-front rule: a case sutdy for two exact sampling algorithms. Technical Report ~566, Department of Mathematical Sciences, The Johns Hopkins University.Google Scholar
- 16.Fill, J. A. and Mac. hida, M. (1996). Stochastic ordering on posets. Unpublished notes.Google Scholar
- 17.Fill, J. A. and Machida, M. (1996). Duality relations for Markov chains on partially ordered state spaces. Unpublished notes.Google Scholar
- 18.Foss, S. G. (1983). On ergoclicity conditions in multiserver queues. Siberian Math. J. 24 168-175.Google Scholar
- 19.Foss, S., Tweedie, R. L., and Corcoran J. (1997). Sireulating the invariant measures of Markov chains using backward coupling at regeneration times. Preprint.Google Scholar
- 20.Geman, S. and Geman, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE 7ka~acti~ on Pattern Analysis and Machine Intelligence, PAMI-6(6).Google Scholar
- 21.H/iggstr6m, O., van Lieshout, M. N. M., and Mzller, J. (1996). Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes. Preprint.Google Scholar
- 22.Higgst~m, O. and Nelander, K. (1997). Exact sampiing from anti-monotone systems. Preprint.Google Scholar
- 23.Kamae, T., Krengel, U., and O'Brien, G. L. (1977). Stochastic inequalities on partially ordered state spaces. Ann. Probab. 5 899-912.Google ScholarCross Ref
- 24.Kendall, W. S. (1996). Perfect simulation for the areainteraction point process, in Proceedings of the Symposlum on Probability towards the Year ~000 (eds.: L. Accardi and C. C. Heyde), Springer, to appear.Google Scholar
- 25.Kendall, W. S. (1996). On some weighted Boolean models. Preprint 295, Department of Statistics, Warwick University.Google Scholar
- 26.Liggett, T. (1985). interacting Particle Systems. Springer-Verlag, New York.Google Scholar
- 27.Lov/sz, L. and Winkler, P. (1995). Exact mixing in an unknown Markov chain. Electronic J. Combinatorics 2 #ms.Google Scholar
- 28.Lurid, R. B., Wilson, D. B., Foss, S., and Tweedie, R. L. (1997). Exact and approximate simulation of the invariant measures of Markov chains. Preprint.Google Scholar
- 29.Propp, J. G. and Wilson, D. B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms 9 223-252. Google ScholarDigital Library
- 30.Ross, S. (1994). A First Course in Probability, 4th ed. Macmillan, New York.Google Scholar
- 31.Sinclair, A. (1993). Al~orithms/or Random Generation and Counting: A Markov Chain Approach. Birkh/iuser, BostorL Google ScholarDigital Library
- 32.Stanley, R. r. (1986). Enumerative Combinatorics, volume 1. Wadsworth & Brooks/Cole, Monterey, California. Google ScholarDigital Library
- 33.Strassen, V. (1965). The existence of probability measures with given marginals. Ann. Matlt Statist 36 423-- 439.Google Scholar
- 34.Wilson, D. B. and Propp, J. G. (1997). How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. Journal of Algorithms, to appear. Google ScholarDigital Library
- 35.Wilson, D. B. (1995). Personal communication.Google Scholar
Index Terms
- An interruptible algorithm for perfect sampling via Markov chains
Recommendations
Sampling Graphical Networks via Conditional Independence Coupling of Markov Chains
Proceedings of the 29th Canadian Conference on Artificial Intelligence on Advances in Artificial Intelligence - Volume 9673Markov Chain Monte Carlo MCMC methods have been used for sampling Online SNs. The main drawbacks are that traditional MCMC techniques such as the Metropolis-Hastings Random Walk MHRW suffer from slow mixing rates, and the resulting sample is usually ...
Optimal Markov chain Monte Carlo sampling
This article is a review article on the optimal Markov chain Monte Carlo MCMC sampling. The focus is on homogeneous Markov chains. This article first reviews the problem of finding the optimal transition matrix, which is defined to minimize the ...
Comments