Content area
Abstract
We study the limiting behavior of three stochastic processes. Two are interacting particle systems, the frog model and coalescing random walk. We work out transience and recurrence properties on various graphs. The last is an interval splitting algorithm, which is shown to be equidistributed in the limit. Many of the proofs hinge on recursive equations of random variables.





