Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T10:22:40.160Z Has data issue: false hasContentIssue false

COVER TIME FOR THE FROG MODEL ON TREES

Published online by Cambridge University Press:  08 November 2019

CHRISTOPHER HOFFMAN
Affiliation:
Department of Mathematics, University of Washington, USA; hoffman@math.washington.edu
TOBIAS JOHNSON
Affiliation:
Department of Mathematics, College of Staten Island, USA; tobias.johnson@csi.cuny.edu
MATTHEW JUNGE
Affiliation:
Department of Mathematics, Duke University, USA; jungem@math.duke.edu

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The frog model is a branching random walk on a graph in which particles branch only at unvisited sites. Consider an initial particle density of $\unicode[STIX]{x1D707}$ on the full $d$-ary tree of height $n$. If $\unicode[STIX]{x1D707}=\unicode[STIX]{x1D6FA}(d^{2})$, all of the vertices are visited in time $\unicode[STIX]{x1D6E9}(n\log n)$ with high probability. Conversely, if $\unicode[STIX]{x1D707}=O(d)$ the cover time is $\exp (\unicode[STIX]{x1D6E9}(\sqrt{n}))$ with high probability.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2019