arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.4559math.COmath.PR
收藏

在图上捕获醉酒抢劫犯

Capturing the Drunk Robber on a Graph

Natasha Komarov, Peter Winkler

摘要:

我们证明了一个聪明的“警察”在$n$ -顶点图上抓住一个喝醉的“强盗”的期望时间至多是$n + {\rm o}(n)$。更准确地说,让$G$是一个简单的,连接的,无向图与区别点$u$和$v$之间的$n$顶点。警察从$u$开始,强盗从$v$开始;他们交替地从一个顶点移动到另一个顶点。强盗随机移动,根据$G$上的一个简单的随机游动;警察看到了一切,并按照她的意愿移动,目的是“捕获”强盗--也就是说,在最短的预期时间内占据同一个顶点。我们表明,警察成功的预期时间不超过$n + {\rm o}(n)$。由于存在捕获时间至少为$n - o(n)$的图形,因此这大致是最佳可能。我们还注意到,没有函数的直径可以是一个约束的捕获时间。

英文摘要:

We show that the expected time for a smart "cop" to catch a drunk "robber" on an $n$-vertex graph is at most $n + {\rm o}(n)$. More precisely, let $G$ be a simple, connected, undirected graph with distinguished points $u$ and $v$ among its $n$ vertices. A cop begins at $u$ and a robber at $v$; they move alternately from vertex to adjacent vertex. The robber moves randomly, according to a simple random walk on $G$; the cop sees all and moves as she wishes, with the object of "capturing" the robber---that is, occupying the same vertex---in least expected time. We show that the cop succeeds in expected time no more than $n + {\rm o}(n)$. Since there are graphs in which capture time is at least $n - o(n)$, this is roughly best possible. We note also that no function of the diameter can be a bound on capture time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑