  Consider a growing system of random walks on the 3,2-alternating tree, where
generations of nodes alternate between having two and three children. Any time
a particle lands on a node which has not been visited previously, a new
particle is activated at that node, and begins its own random walk. The model
described belongs to a class of problems that are collectively referred to as
the frog model. Building on a recent proof of recurrence (meaning infinitely
many frogs hit the root with probability one) on the regular binary tree, this
paper establishes recurrence for the 3,2-alternating case.
