Event Type:

Probability Seminar

Date/Time:

Thursday, April 16, 2015 - 12:00 to 13:00

Location:

GILK 115

Guest Speaker:

Institution:

University of Washington

Abstract:

On a d-ary tree place some number (random or otherwise) of sleeping frogs at each site, as well as one awake frog at the root. Awake frogs perform simple random walk and wake any "sleepers" they encounter. A longstanding open problem: Does every frog wake up? It turns out this depends on d and the amount of frogs. The proof uses two different recursions and two different versions of stochastic domination. Joint with Christopher Hoffman and Tobias Johnson.