Effective dimension of points visited by Brownian motion

DOI10.1016/J.TCS.2008.09.045MaRDI QIDQ1004080zbMATH OpenOpenAlexFDO

Authors Bjørn Kjos-Hanssen, Anil Nerode

Publication date 2 March 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.2883

zbMATH Keywords

Brownian motionalgorithmic randomnesseffective randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: 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.

Recommendations

• On zeros of Martin-Löf random Brownian motion
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
• Applications of Effective Probability Theory to Martin-Löf Randomness
• Dimensional properties of one-dimensional Brownian motion
• Quasi-everywhere properties of Brownian level sets and multiple points

Cites work

• scientific article; zbMATH DE number 5819433 (Why is no real title available?)
• scientific article; zbMATH DE number 46153 (Why is no real title available?)
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 3306375 (Why is no real title available?)
• scientific article; zbMATH DE number 2216397 (Why is no real title available?)
• Arithmetical representations of Brownian motion I
• Dynamics of a generic Brownian motion: Recursive aspects
• Kolmogorov-Loveland randomness and stochasticity
• The descriptive complexity of Brownian motion
• Use of the Kolmogorov complexity in analyzing control system dynamics
• When van Lambalgen’s Theorem fails

Cited in

(17)

• The rapid points of a complex oscillation
• Kolmogorov complexity and strong approximation of Brownian motion
• On hardly visited points of the Brownian motion
• scientific article; zbMATH DE number 897209 (Why is no real title available?)
• Polynomial time relatively computable triangular arrays for almost sure convergence
• Randomness, computation and mathematics
• On zeros of Martin-Löf random Brownian motion
• The descriptive complexity of stochastic integration
• Mutual dimension
• The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
• Members of Random Closed Sets
• On the computability of a construction of Brownian motion
• Martin-Löf randomness and Galton-Watson processes
• Kolmogorov complexity and the geometry of Brownian motion
• On local times of Martin-Löf random Brownian motion
• Computable randomness and betting for computable probability spaces
• Lines missing every random point

This page was built for publication: Effective dimension of points visited by Brownian motion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004080)