๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms

โœ Scribed by G.O. Roberts; A.F.M. Smith

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
639 KB
Volume
49
Category
Article
ISSN
0304-4149

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Geometric convergence of the Metropolis-
Geometric convergence of the Metropolis-Hastings simulation algorithm
โœ Lars Holden ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

Necessary and sufficient conditions for uniform geometric convergence in the relative supremum norm of the Metropolis-Hastings simulation algorithm with a general generating function are established. An explicit expression for the convergence rate is given. (~

Random variate transformations in the Gi
Random variate transformations in the Gibbs sampler: issues of efficiency and convergence
โœ Petros Dellaportas ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Springer US ๐ŸŒ English โš– 692 KB

In the non-conjugate Gibbs sampler, the required sampling from the full conditional densities needs the adoption of black-box sampling methods. Recent suggestions include rejection sampling, adaptive rejection sampling, generalized ratio of uniforms, and the Griddy-Gibbs sampler. This paper describe

Sufficient conditions for the convergenc
Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms
โœ Amir Ajorlou; Ahmadreza Momeni; Amir G. Aghdam ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 271 KB

This paper is concerned with the convergence of a class of continuous-time nonlinear consensus algorithms for single integrator agents. In the consensus algorithms studied here, the control input of each agent is assumed to be a state-dependent combination of the relative positions of its neighbors