Skip to main content


Fig. 3 | EURASIP Journal on Advances in Signal Processing

Fig. 3

From: Adaptive independent sticky MCMC algorithms

Fig. 3

Graphical representation of the underlying idea behind the update control test. For simplicity, in this figure, we have assumed η t (z,d)=η t (d). As the proposal function q t becomes closer and closer to π, the probability of adding a new node to \(\mathcal {S}_{t}\) decreases

Back to article page