arXiv:1408.2883 [math.LO]AbstractReferencesReviewsResources
Effective dimension of points visited by Brownian motion
Bjørn Kjos-Hanssen, Anil Nerode
Published 2014-08-13Version 1
We consider the individual points on a Martin-L\"of random path of Brownian motion. We show (1) that Khintchine's law of the iterated logarithm holds at almost all points; and (2) there exist points (besides the trivial example of the origin) having effective dimension $<1$. The proof of (1) shows that for almost all times $t$, the path $f$ is Martin-L\"of random relative to $t$ and so the effective dimension of $(t,f(t))$ is 2.
Comments: The conference version was published as: The law of the iterated logarithm for algorithmically random paths of Brownian motion, Logical Foundations of Computer Science, Lecture Notes in Computer Science 4514 (2007), 310--317
Journal: Theoretical Computer Science 410 (2009), no. 4-5, 347--354
Categories: math.LO
Related articles:
arXiv:1408.2278 [math.LO] (Published 2014-08-10)
Kolmogorov complexity and strong approximation of Brownian motion
arXiv:1709.05266 [math.LO] (Published 2017-09-15)
Dimension 1 sequences are close to randoms
arXiv:2103.03965 [math.LO] (Published 2021-03-05)
The intersection of algorithmically random closed sets and effective dimension