Simulated annealing algorithms and Markov chains with rare transitions
Olivier Catoni (1999)
Séminaire de probabilités de Strasbourg
Similarity:
Olivier Catoni (1999)
Séminaire de probabilités de Strasbourg
Similarity:
Hans C. Andersen, Persi Diaconis (2007)
Journal de la société française de statistique
Similarity:
We present a generalization of hit and run algorithms for Markov chain Monte Carlo problems that is ‘equivalent’ to data augmentation and auxiliary variables. These algorithms contain the Gibbs sampler and Swendsen-Wang block spin dynamics as special cases. The unification allows theorems, examples, and heuristics developed in one domain to illuminate parallel domains.
Claudio Asci, Mauro Piccioni (2009)
Kybernetika
Similarity:
The BIPF algorithm is a Markovian algorithm with the purpose of simulating certain probability distributions supported by contingency tables belonging to hierarchical log-linear models. The updating steps of the algorithm depend only on the required expected marginal tables over the maximal terms of the hierarchical model. Usually these tables are marginals of a positive joint table, in which case it is well known that the algorithm is a blocking Gibbs Sampler. But the algorithm makes...
Goertzel, Ben, Ananda, Malwane (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Duan, Qihong, Chen, Zhiping, Zhao, Dengfu (2010)
Mathematical Problems in Engineering
Similarity:
Martin Janžura, Pavel Boček (1998)
Kybernetika
Similarity:
With the aid of Markov Chain Monte Carlo methods we can sample even from complex multi-dimensional distributions which cannot be exactly calculated. Thus, an application to the problem of knowledge integration (e. g. in expert systems) is straightforward.