Portland State University Discrete Mathematics Seminar

Spring 2015: Neuberger Hall 209, Mondays, 3–4pm (previous quarters)

April 13, 2015

Matthew Junge, University of Washington
The frog model on trees

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 number of frogs. The proof uses two different recursions and two different versions of stochastic domination. Joint work with Christopher Hoffman and Tobias Johnson.

May 4, 2015

Ewan Kummel, Portland State University

May 18, 2015

Joseph Wooster, Portland State University

June 1, 2015

Ronni Atchley, Portland State University