首页 | 本学科首页   官方微博 | 高级检索  
     


Computational complexity of Markov chain Monte Carlo methods for finite Markov random fields
Authors:FRIGESSI, ARNOLDO   MARTINELLI, FABIO   STANDER, JULIAN
Affiliation:Dipartimento di Matematica, Universit di Roma Tre, via Segre 2, 00146 Roma, Italy e-mail: frigessi{at}mat.uniroma3.it martin{at}mat.uniroma3.it
Department of Mathematics and Statistics, University of Plymouth Drake Circus, Plymouth, PL4 8AA, U.K. e-mail: J.Stander{at}plymouth.ac.uk
Abstract:
Keywords:Gibbs sampler    Metropolis algorithm    NP-completeness    Range of interaction    Rate of convcrgence    Spectral gap    Stopping rule
本文献已被 Oxford 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号