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

关于生长图上的随机游动

On random walk on growing graphs

Ruojun Huang

摘要:

研究了变化图上的随机游动。对于有限图序列向极限无限图单调递增的情形,我们建立了转移概率的上界。在已知每个图的体积和Cheeger常数的情况下,给出了慢增长图上简单随机游动的充分瞬态准则。对于更特殊的情况下,我们建立匹配的下界,并推导出充分的(弱)递归准则。我们还解决复发直接关系到一个普遍性猜想[国土安全部]。我们对[SZ,问题1.8]中关于“非齐次合并”的一个相关问题作了否定的回答。

英文摘要:

Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple random walk on slowly growing graphs, upon knowing the volume and Cheeger constant of each graph. For much more specialized cases, we establish matching lower bounds, and deduce sufficient (weak) recurrence criteria. We also address recurrence directly in relation to a universality conjecture of [DHS]. We answer a related question of [SZ, Problem 1.8] about "inhomogeneous merging" in the negative.

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

↑