





















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 $μ$ on the full $d$-ary tree of height $n$. If $μ= Ω( d^2)$, all of the vertices are visited in time $Θ(n\log n)$ with high probability. Conversely, if $μ= O(d)$ the cover time is $\exp(Θ(\sqrt n))$ with high probability.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。