Algorithm S1 with multinomial resampling and potential functions of the current state #
By Proposition S3 of the supplementary material, with multinomial resampling and potential
functions g_t(x_{t-1}, x_t) = g_t(x_t) of the current state, the reference and the output have the
same joint distribution under Algorithm S1 as under Algorithm 1, for any kernels as in Algorithm 1.
The model M' of Section S3 has the densities and the potential functions of the model M of the
main text. Its weights and backward-sampling probabilities (S3) are then those of M, so that,
given the particle positions, the backward Markov chains pairChain of the two algorithms
coincide. With multinomial resampling, the factor of the density (S4) which depends on the particle
positions and the ancestor indices is the sum over b_T of the density (6), so that the particle
positions have the same distribution under the density (S4) as under π̄.
If the potential functions of M' are those of M, the weights of M' are those of M.
If M' has the transition densities and the potential functions of M, its
backward-sampling probabilities (S3) are those of M: the factor g_{t+1}(x_{t+1}^j) cancels.
If M' has the densities and the potential functions of M, the two models have the same
normalizing constant.
With multinomial resampling, if M' has the densities and the potential functions of M, the
sum over the indices of the reference of the density (S4) with the Gibbs kernels is the sum over
b_T of the density (6).
Multinomial resampling is a measurable function of the particles and the weights.
With multinomial resampling, if M' has the densities and the potential functions of M, the
particle positions have the same distribution under the density (S4) with the Gibbs kernels as
under π̄.
Proposition S3: with multinomial resampling, if M' has the densities and the potential
functions of M, then, for x_{1:T} ∼ π and measurable kernels as in Algorithm 1, the reference
and the output have the same joint distribution under Algorithm S1 as under Algorithm 1.