【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-Loef 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.
机译:算法随机性最常在Cantor空间上的公平硬币度量或单位间隔上的等效Lebesgue度量的设置中进行研究。对于连续函数空间的维纳度量也已经考虑了这一点。回答Fouche问题,我们证明了Khintchine的对数迭代定律在布朗运动的每个Martin-Loef随机路径的几乎所有点上都成立。用Fouche的术语来说,这是复杂的振荡。证明的主要新思想是利用Wiener-Caratheodory测度代数同构定理。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号