Additive Set-Valued Markov Processes and Graphical Methods

Let Z be a countable set, the set of subsets of Z. A -valued Markov process \ₜ\ with transition function P (t, , ) is called additive if there exists a family \Aₜ, t 0, A \ such that for each A, \Aₜ\ is Markov with transition function P and A₀ = A, and such that ^A Bₜ = Aₜ Bₜ, A, B, t 0. Additive processes include symmetric simple exclusion, voter models and all contact processes having associates. The structure of such processes is studied, their construction from sets of independent Poisson flows, and their representations by random graphs. Applications for the case Z = Zd, the d-dimensional integers, include individual ergodic theorems for certain cases as well as lower bounds for growth rates, and some results about different kinds of criticality when d = 1.