Green (1995) proposes a general framework — reversible jump Markov chain Monte Carlo (RJMCMC) — for constructing reversible Markov chain samplers that jump between parameter subspaces of differing dimensionality. The central innovation is dimension matching: when proposing a move from a model of dimension n1 to one of dimension n2, auxiliary random variables u are drawn so that n1+m1=n2+m2, enabling a differentiable bijection and ensuring detailed balance via a Jacobian correction. Three applications are demonstrated: multiple change-point analysis for a Poisson process (coal mining disasters 1851–1962), two-dimensional image segmentation via Voronoi tessellation, and Bayesian partition models for binomial experiments.
Key Claims
Standard MCMC is restricted to fixed-dimensional parameter spaces; RJMCMC extends the Metropolis-Hastings framework to trans-dimensional model spaces {Mk,k∈K} where the joint distribution is p(k,θ(k),y)=p(k)p(θ(k)∣k)p(y∣k,θ(k)).
Dimension-matching bijection: to jump from dimension n1 to n2, draw auxiliary variables u(1) (length m1) and u(2) (length m2) with n1+m1=n2+m2, making (θ(1),u(1))↔(θ(2),u(2)) a bijection g.
Acceptance probability for a trans-dimensional move x=(1,θ(1))→x′=(2,θ(2)) (eq. 7):
α=min{1,p(1,θ(1)∣y)j(1,θ(1))q1(u(1))p(2,θ(2)∣y)j(2,θ(2))q2(u(2))∂(θ(1),u(1))∂(θ(2),u(2))}
Jump-diffusion (Grenander-Miller 1994) only approximately maintains detailed balance in within-subspace moves; Carlin-Chib (1995) product-space approach requires continual updating of irrelevant parameters, limiting scalability; embedding methods are cumbersome.
Prior distributions across subspaces need not be individually normalised, but relative normalising constants must be consistent — a constraint Grenander & Miller (1994) overlooked.
The sampler is entirely constructive: no integration is needed to set up the transition mechanism (Remark 1, p. 715).
Multiple move types are combined at random to form a hybrid sampler (Tierney 1994); detailed balance is enforced within each move type separately.
Change-point application (§4): piecewise-constant Poisson rate on [0,L]; k∼Poisson(λ), truncated at kmax; step positions are even-order statistics from 2k+1 uniform [0,L] draws (spacing prior); heights hj∼Gamma(α,β). Move types: H (height), P (position), birth (k→k+1), death (k→k−1). Birth splits height hj of the interval containing s∗ into hj′,hj+1′ via u∼Uniform[0,1] with hj+1′/hj′=(1−u)/u; the Jacobian is (hj′+hj+1′)2/hj.
Coal mining results: n=192 disasters, L=40,907 days, λ=3, α=1, β=200, kmax=30; 40,000 iterations after 4,000 burn-in (45 sec, Sun Sparc 2); posterior mode k=3; main change-point near day 14420 ≈ 25 June 1890 (95% credible interval: 24 May 1887–7 May 1896).
Image segmentation (§5): Voronoi tessellation with k tiles; birth/death of generating points; synthetic 50×50 disc image recovered after 20,000 sweeps, 260 sec.
Partition models (§6): pine seedling mortality data (n=4 binomial responses, 2×2 factorial; Consonni-Veronese 1995); RJMCMC results replicate analytic approximations; random-q extension posterior mean q^=181, standard deviation (SD) =58.
"This paper proposes a new framework for the construction of reversible Markov chain samplers that jump between parameter subspaces of differing dimensionality, which is flexible and entirely constructive." (p. 711)
"The definition of the sampling method is entirely constructive. No integration, by simulation or otherwise, is needed to set up the transition mechanism." (Remark 1, p. 715)
"Although as usual with Hastings methods, the distribution π need not be normalised, relative normalising constants between different subspaces are needed … a point apparently missed by Grenander & Miller (1994)." (Remark 3, p. 715)
My Take
This is the foundational paper for RJMCMC — cited in virtually every Bayesian variable-dimension paper since 1995. The key insight is elegant: add auxiliary variables to equate dimensions, then use a standard Jacobian acceptance ratio. The main practical challenge — choosing the bijection g and proposal q(u) for efficient mixing — is left problem-specific, and Green acknowledges no claim of optimality for his particular choices. The coal mining example has become a standard benchmark. The paper's three-application breadth (1D change-point, 2D image segmentation, partition models) is effective. The convergence diagnostics problem for trans-dimensional chains, acknowledged by Green in §7, remains an active area of research. Richardson-Green (1997) later applied RJMCMC to Bayesian mixture estimation with unknown k — the canonical follow-up.