DeepAI AI Chat
Log In Sign Up

Local time of Martin-Lof Brownian motion

by   Willem Fouché, et al.

In this paper we study the local times of Brownian motion from the point of view of algorithmic randomness. We introduce the notion of effective local time and show that any path which is Martin-Löf random with respect to the Wiener measure has continuous effective local times at every computable point. Finally we obtain a new simple representation of classical Brownian local times, computationally expressed.


page 1

page 2

page 3

page 4


On the close interaction between algorithmic randomness and constructive/computable measure theory

This is a survey of constructive and computable measure theory with an e...

Algorithmic Randomness and Kolmogorov Complexity for Qubits

Nies and Scholz defined quantum Martin-Löf randomness (q-MLR) for states...

Generating Randomness from a Computable, Non-random Sequence of Qubits

Nies and Scholz introduced the notion of a state to describe an infinite...

Randomized Computation of Continuous Data: Is Brownian Motion Computable?

We consider randomized computation of continuous data in the sense of Co...

Hölder Conditions of Local Times and Exact Moduli of non-differentiability for Spherical Gaussian fields

This paper investigate the local times and modulus of nondifferentiabili...

Effective Continued Fraction Dimension versus Effective Hausdorff Dimension of Reals

We establish that constructive continued fraction dimension originally d...