Kolmogorov复杂性与布朗运动的强逼近
Kolmogorov complexity and strong approximation of Brownian motion
摘要:
布朗运动和缩放内插简单随机游动可以联合嵌入概率空间中,使得对于除了1/2个正整数$n$之外的所有正整数,几乎肯定$n$步游动在布朗路径的均匀距离$O(n^{-1/2}\log n)$内。几乎可以肯定的是,这个$n$步行走在柯尔莫哥洛夫复杂性的意义下是不可压缩的,并且所有布朗运动的{马丁-洛夫随机}路径都有这样一个不可压缩的紧密逼近。这加强了Asarin的一个结果,他得到了束缚$O(n^{-1/6} \log n)$。结果无法改善为$o(n^{-1/2}{\sqrt{\log n}})$。
英文摘要:
Brownian motion and scaled and interpolated simple random walk can be jointly embedded in a probability space in such a way that almost surely the $n$-step walk is within a uniform distance $O(n^{-1/2}\log n)$ of the Brownian path for all but finitely many positive integers $n$. Almost surely this $n$-step walk will be incompressible in the sense of Kolmogorov complexity, and all {Martin-Löf random} paths of Brownian motion have such an incompressible close approximant. This strengthens a result of Asarin, who obtained the bound $O(n^{-1/6} \log n)$. The result cannot be improved to $o(n^{-1/2}{\sqrt{\log n}})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。