메뉴 건너뛰기




Volumn 31, Issue 3, 2003, Pages 748-753

Slice sampling: Discussion

Author keywords

[No Author keywords available]

Indexed keywords


EID: 2442442128     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Note
Times cited : (2)

References (17)
  • 2
    • 0032396902 scopus 로고    scopus 로고
    • An interruptible algorithm for perfect sampling via Markov chains
    • FILL, J. A. (1998). An interruptible algorithm for perfect sampling via Markov chains. Ann. Appl. Probab. 8 131-162.
    • (1998) Ann. Appl. Probab. , vol.8 , pp. 131-162
    • Fill, J.A.1
  • 3
    • 77956889087 scopus 로고
    • Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
    • GREEN, P. J. (1995). Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika 82 711-732.
    • (1995) Biometrika , vol.82 , pp. 711-732
    • Green, P.J.1
  • 4
    • 0042908796 scopus 로고    scopus 로고
    • Delayed rejection in reversible jump Metropolis-Hastings
    • GREEN, P. J. and MIRA, A. (2001). Delayed rejection in reversible jump Metropolis-Hastings. Biometrika 88 1035-1053.
    • (2001) Biometrika , vol.88 , pp. 1035-1053
    • Green, P.J.1    Mira, A.2
  • 5
    • 0034264679 scopus 로고    scopus 로고
    • Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
    • KENDALL, W. S. and MØLLER, J. (2000). Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes. Adv. in Appl. Probab. 32 844-865.
    • (2000) Adv. in Appl. Probab. , vol.32 , pp. 844-865
    • Kendall, W.S.1    Møller, J.2
  • 7
    • 84891435216 scopus 로고    scopus 로고
    • On Metropolis-Hastings algorithms with delayed rejection
    • MIRA, A. (2002). On Metropolis-Hastings algorithms with delayed rejection. Metron 59 231-241.
    • (2002) Metron , vol.59 , pp. 231-241
    • Mira, A.1
  • 9
    • 0036005408 scopus 로고    scopus 로고
    • Efficiency and convergence properties of slice samplers
    • MIRA, A. and TIERNEY, L. (2002). Efficiency and convergence properties of slice samplers. Scand. J. Statist. 29 1-12.
    • (2002) Scand. J. Statist. , vol.29 , pp. 1-12
    • Mira, A.1    Tierney, L.2
  • 10
    • 0015730787 scopus 로고
    • Optimum Monte Carlo sampling using Markov chains
    • PESKUN, P. H. (1973). Optimum Monte Carlo sampling using Markov chains. Biometrika 60 607-612.
    • (1973) Biometrika , vol.60 , pp. 607-612
    • Peskun, P.H.1
  • 11
    • 0005193926 scopus 로고    scopus 로고
    • Exact sampling with coupled Markov chains and applications to statistical mechanics
    • PROPP, J. and WILSON, D. B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures Algorithms 9 223-252.
    • (1996) Random Structures Algorithms , vol.9 , pp. 223-252
    • Propp, J.1    Wilson, D.B.2
  • 13
    • 0035535910 scopus 로고    scopus 로고
    • Markov chains and deinitialising processes
    • ROBERTS, G. O. and ROSENTHAL, J. S. (2001). Markov chains and deinitialising processes. Scand. J. Statist. 28 489-505.
    • (2001) Scand. J. Statist. , vol.28 , pp. 489-505
    • Roberts, G.O.1    Rosenthal, J.S.2
  • 15
    • 0034196166 scopus 로고    scopus 로고
    • Rates of convergence of stochastically monotone and continuous time Markov models
    • ROBERTS, G. O. and TWEEDIE, R. L. (2000). Rates of convergence of stochastically monotone and continuous time Markov models. J. Appl. Probab. 37 359-373.
    • (2000) J. Appl. Probab. , vol.37 , pp. 359-373
    • Roberts, G.O.1    Tweedie, R.L.2
  • 16
    • 0033619197 scopus 로고    scopus 로고
    • Some adaptive Monte Carlo methods for Bayesian inference
    • TIERNEY, L. and MIRA, A. (1999). Some adaptive Monte Carlo methods for Bayesian inference. Statistics in Medicine 18 2507-2515.
    • (1999) Statistics in Medicine , vol.18 , pp. 2507-2515
    • Tierney, L.1    Mira, A.2
  • 17
    • 0034381555 scopus 로고    scopus 로고
    • How to couple from the past using a read-once source of randomness
    • WILSON, D. B. (2000). How to couple from the past using a read-once source of randomness. Random Structures Algorithms 16 85-113.
    • (2000) Random Structures Algorithms , vol.16 , pp. 85-113
    • Wilson, D.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.