Stochastic flows on a countable set: Convergence in distribution

Consider a sequenceF ₁,F ₂,... of i.i.d. random transformations from a countable setV toV. Such a sequence describes a discrete-time stochastic flow onV, in which the position at timen of a particle that started at sitex isM _n(x), whereM _n =F _n F _n–1 F ₁. We give conditions on the law ofF ₁ for the sequence (M _n) to be tight, and describe the possible limiting law. an example called the block charge model is introduced. The results can be formulated as a statement about the convergence in distribution of products of infinite-dimensional random stochastic matrices. In practical terms, they describe the possible equilibria for random motions of systems of particles on a countable set, without births or deaths, where each site may be occupied by any number of particles, and all particles at a particular site move together.