We study the cover time of a random walk on graphs G ∈ Gn, p when p = c log n/n, c 1. We prove that whpthe cover time is asymptotic to c log (c/c--1) n log n.
展开▼
机译:当图 p I> = G I>∈ G n,p INF> I>上研究随机游走的覆盖时间> c I> log n I> / n I>, c I> <1。我们证明 whp B>的覆盖时间与 c I> log( c I> / c I>-1) n I> log n I渐近>。
展开▼