Speaker Matthew Junge
Affiliation University of Washington
Host Yuval Peres
Date recorded 18 July 2014
The frog model is a branching random walk that splits into two particles upon the first visit to each site. We prove a phase transition from recurrence to transience on the rooted d-ary tree. For d=2 the root is a.s. visited infinitely often and for d>4 only finitely often. This covers all but two cases of one of the longest standing open problems for this model. We conjecture the ternary tree remains recurrent while the quadrary tree is transient. This work is joint with Christopher Hoffman, Tobias Johnson and Matthew Junge.
©2014 Microsoft Corporation. All rights reserved.