Fourier spectra of measures associated with algorithmically random Brownian motion
From MaRDI portal
Abstract: In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion. We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff dimensions of these sets, optimal asymptotic decay at infinity. The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the prefix free Kolmogorov complexity of finite binary sequences. The study also necessitates a closer look at the potential theory over fractals from a computable point of view.
Recommendations
- Algorithmically random series and Brownian motion
- Fractals generated by algorithmically random Brownian motion
- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion
- Diophantine properties of Brownian motion: recursive aspects
- On the computability of a construction of Brownian motion
Cited in
(9)- Algorithmically random series and Brownian motion
- Computation of some examples of Brown's spectral measure in free probability
- How constructive is constructing measures?
- Fractals generated by algorithmically random Brownian motion
- The descriptive complexity of stochastic integration
- Computable Measure Theory and Algorithmic Randomness
- On local times of Martin-Löf random Brownian motion
- The zero set of fractional Brownian motion is a Salem set
- Random exponential sums and lattice points in regions
This page was built for publication: Fourier spectra of measures associated with algorithmically random Brownian motion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921117)