首页> 外文会议>International Symposium on Logical Foundations of Computer Science >The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
【24h】

The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion

机译:算法随机褐色运动迭代对数的定律

获取原文

摘要

Algorithmic randomness is most often studied in the setting of the fair-coin measure on the Cantor space, or equivalently Lebesgue measure on the unit interval. It has also been considered for the Wiener measure on the space of continuous functions. Answering a question of Fouche, we show that Khintchine’s law of the iterated logarithm holds at almost all points for each Martin-Lof random path of Brownian motion. In the terminology of Fouche, these are the complex oscillations. The main new idea of the proof is to take advantage of the Wiener-Caratheodory measure algebra isomorphism theorem.
机译:算法随机性最常在唱名空间上的公平硬币测量的设置中进行研究,或在单位间隔上等效的Lebesgue测量。它还被认为是在连续功能的空间上的维纳措施。回答一个小级问题,我们展示了Khintchine的迭代对数的定律,几乎所有的Partin-Lof武装运动随机路径的点。在Fouche的术语中,这些是复杂的振荡。证据的主要新思路是利用维纳 - 加勒比尺度代数定理定理。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号