随机增长离散结构中的持久随机性:图与搜索树
Persisting randomness in randomly growing discrete structures: graphs and search trees
AI总结:
本文利用离散位势理论,检测并量化随机增长离散结构(如图与搜索树)中随机性的持久性,并在仅知分布收敛的情形下获得强极限定理。
摘要:
由随机输入通过顺序算法生成的连续离散结构构成一个马尔可夫链,该链可能对其最初几个输入值表现出长期依赖性。利用随机图理论和搜索算法中的例子,我们展示了如何借助离散位势理论的技术来检测并量化这种随机性的持久性。我们还表明,在以往仅已知分布收敛的情况下,这种方法可用于获得强极限定理。
英文摘要:
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search algorithms we show how such persistence of randomness can be detected and quantified with techniques from discrete potential theory. We also show that this approach can be used to obtain strong limit theorems in cases where previously only distributional convergence was known.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。