arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.7617math.PR
收藏

覆盖次数指数集中

Exponential concentration of cover times

Alex Zhai

摘要:

我们证明了一般图的覆盖时间在高斯自由域上的指数集中界,推广了Ding-Lee-Peres和Ding的工作。当首中时与覆盖时间之比趋于零时,该估计是渐近尖锐的。通过证明广义第二Ray-Knight定理中的随机控制,得到了该界,该定理由Ding证明意味着覆盖时间的指数集中。这个随机控制的结果在早期的《卢浦》预印本中出现过,但没有提到与覆盖时间的关系。

英文摘要:

We prove an exponential concentration bound for cover times of general graphs in terms of the Gaussian free field, extending the work of Ding-Lee-Peres and Ding. The estimate is asymptotically sharp as the ratio of hitting time to cover time goes to zero. The bounds are obtained by showing a stochastic domination in the generalized second Ray-Knight theorem, which was shown to imply exponential concentration of cover times by Ding. This stochastic domination result appeared earlier in a preprint of Lupu, but the connection to cover times was not mentioned.

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

↑