duality as an analytical tool
Duality is the single most powerful analytic technique in the theory of interacting particle systems, and often the only one that gives exact answers. The basic problem is that an IPS lives on an enormous configuration space and we cannot track all sites at once. Duality solves a question about a complicated process by relating it, exactly, to a question about a second, usually simpler, dual process — frequently one with far fewer 'particles' to follow. The voter / coalescing-walk and contact-process self-duality are the famous instances; the general method is a precise algebraic relationship between two Markov generators through a duality function.
Formally, two Markov processes X_t (on space E) and Y_t (on space F) are dual with respect to a function H : E x F -> R if for all x, y and times t, E_x[ H(X_t, y) ] = E_y[ H(x, Y_t) ]. The whole point is that the time-evolution acting on the X variable equals the time-evolution acting on the Y variable through the fixed pairing H. The way to establish this is at the level of generators: it suffices that (L_X H( . , y))(x) = (L_Y H(x, . ))(y) for all x, y, an identity one verifies by writing out both generators term by term; the equality of expectations then follows by integrating the semigroups. For a particle system the dual H(eta, A) is typically an indicator like 'eta is occupied (or empty) on the finite set A', and the dual process Y is a finite system of A — a handful of (possibly coalescing or branching) random walks — so an intractable question about infinitely many sites collapses to a tractable question about finitely many dual walkers. This is exactly how one proves the voter model's phase diagram (recurrence of coalescing walks), the contact process's survival-equilibrium correspondence (self-duality), and the self-duality of symmetric exclusion.
Duality matters because it converts forward, high-dimensional, configuration questions into backward, low-dimensional, genealogical ones, and it is the reason a handful of particle systems are essentially exactly solvable. It is intimately connected to reversibility (a reversible chain is self-dual with respect to its stationary density), to time reversal, and to the genealogical / coalescent picture in population genetics. The honest caveats are real: duality is not a universal tool — finding a useful duality function is an art, many systems have none, and the existence of a dual is a genuine structural property of the model, usually tied to algebraic symmetry (the SU(2) / quantum-group symmetry behind exclusion-process dualities). Moreover a duality gives information only about the functionals H one can pair against; it answers the questions H can express and is silent about others. When it works it is decisive; when it does not, one falls back on monotonicity, coupling, and comparison.
Symmetric exclusion is self-dual with duality function H(eta, A) = product over x in A of eta(x) = 1{all sites of the finite set A are occupied}. Then E_eta[ H(eta_t, A) ] = E_A[ H(eta, A_t) ], where A_t is a system of |A| symmetric exclusion 'dual particles' (which themselves perform exclusion). To compute a correlation between k sites of the infinite system, one only has to follow k dual walkers — a finite computation.
Duality trades an infinite-site question for a finite dual one: k-point correlations from following just k dual walkers.
Duality is exact and decisive but not universal — finding a useful duality function is an art, many systems have none, and existence of a dual is a structural property usually tied to algebraic symmetry. A duality answers only the questions its pairing function H can express.