The rapid points of a complex oscillationArticle
Authors: Paul Potgieter
NULL
Paul Potgieter
By considering a counting-type argument on Brownian sample paths, we prove a result similar to that of Orey and Taylor on the exact Hausdorff dimension of the rapid points of Brownian motion. Because of the nature of the proof we can then apply the concepts to so-called complex oscillations (or 'algorithmically random Brownian motion'), showing that their rapid points have the same dimension.
Comment: 11 pages
Volume: Volume 8, Issue 1
Secondary volumes: Selected Papers of the 8th Conference on Computability and Complexity in Analysis (CCA 2011)
Published on: March 9, 2012
Imported on: May 17, 2011
Keywords: Computer Science - Computational Complexity, Mathematics - Probability, G.3, F.1.1
Funding:
Source : OpenAIRE Graph- Computable Analysis; Funder: European Commission; Code: 294962