Dynamics of a generic Brownian motion: Recursive aspects (original) (raw)
Related papers
The Descriptive Complexity of Brownian Motion
Advances in Mathematics, 2000
A continuous function x on the unit interval is a generic Brownian motion when every probabilistic event which holds almost surely with respect to the Wiener measure is reflected in x, provided that the event has a suitably effective description. We show that a generic one-dimensional Brownian motion can be computed from an infinite binary string which is complex in the sense of Kolmogorov Chaitin. Conversely, one can construct a Kolmogorov Chaitin random string from the values at the rational numbers of a generic Brownian motion. In this way, we construct a recursive isomorphism between encoded versions of generic Brownian motions and Kolmogorov Chaitin random reals.
Diophantine properties of brownian motion: recursive aspects
2014
We use recent results on the Fourier analysis of the zero sets of Brownian motion to explore the diophantine properties of an algorithmically random Brownian motion ( also known as a complex oscillation). We discuss the construction and definability of perfect sets which are linearly independent over the rationals directly from Martin-Löf random reals. Finally we explore the recent work of Tsirelson on countable dense sets to study the diophantine properties of local minimisers of Brownian motion.
Snakes and spiders: Brownian motion on ℝ-trees
Probability Theory and Related Fields, 2000
We consider diffusion processes on a class of -ޒtrees. The processes are defined in a manner similar to that of Le Gall's Brownian snake. Each point in the tree has a real-valued "height" or "generation", and the height of the diffusion process evolves as a Brownian motion. When the height process decreases the diffusion retreats back along a lineage, whereas when the height process increases the diffusion chooses among branching lineages according to relative weights given by a possibly infinite measure on the family of lineages. The class of -ޒtrees we consider can have branch points with countably infinite branching and lineages along which the branch points have points of accumulation. We give a rigorous construction of the diffusion process, identify its Dirichlet form, and obtain a necessary and sufficient condition for it to be transient. We show that the tail σ-field of the diffusion is always trivial and draw the usual conclusion that bounded space-time harmonic functions are constant. In the transient case, we identify the Martin compactification and obtain the corresponding integral representations of excessive and harmonic functions. Using Ray-Knight methods, we show that the only entrance laws for the diffusion are the trivial ones that arise from starting the process inside the state-space. Finally, we use the Dirichlet form stochastic calculus to obtain a semimartingale description of the diffusion that involves local time additive functionals associated with each branch point of the tree.
Kolmogorov complexity and the geometry of Brownian motion
Mathematical Structures in Computer Science, 2014
In this paper, we continue the study of the geometry of Brownian motions which are encoded by Kolmogorov-Chaitin random reals (complex oscillations). We unfold Kolmogorov-Chaitin complexity in the context of Brownian motion and specifically to phenomena emerging from the random geometric patterns generated by a Brownian motion.
Stochastic dynamics for an infinite system of random closed strings: A Gibbsian point of view
Stochastic Processes and their Applications, 1996
We consider the stochastic dynamics of infinitely many, interacting random closed strings, and show that the law of this process can be characterized as a Gibbs state for some Hamiltonian on the path level, which is represented in terms of the interaction. This is done by means of the stochastic calculus of variations, in particular an integration by parts formula in infinite dimensions. This Gibbsian point of view of the stochastic dynamics allows us to characterize the reversible states as the Gibbs states for the underlying interaction. Under supplementary monotonicity conditions, there is only one stationary distribution, and we prove that there is exactly one Gibbs state.
Brownian motion on the continuum tree
Probability Theory and Related Fields, 1995
We construct Brownian motion on a continuum tree, a structure introduced as an asymptotic limit to certain families of finite trees. We approximate the Dirichlet form of Brownian motion on the continuum tree by adjoining one-dimensional Brownian excursions. We study the local times of the resulting diffusion. Using time-change methods, we find explicit expressions for certain hitting probabilities and the mean occupation density of the process.
Fourier spectra of measures associated with algorithmically random Brownian motion
Logical Methods in Computer Science, 2014
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.
Reflection and coalescence between independent one-dimensional Brownian paths
Annales de l'Institut Henri Poincare (B) Probability and Statistics, 2000
Take two independent one-dimensional processes as follows: (B t , t ∈ [0, 1]) is a Brownian motion with B 0 = 0, and (β t , t ∈ [0, 1]) has the same law as (B 1−t , t ∈ [0, 1]); in other words, β 1 = 0 and β can be seen as Brownian motion running backwards in time. Define (γ t , t ∈ [0, 1]) as being the function that is obtained by reflecting B on β. Then γ is still a Brownian motion. Similar and more general results (with families of coalescing Brownian motions) are also derived. They enable us to give a precise definition (in terms of reflection) of the joint realization of finite families of coalescing/reflecting Brownian motions.
On the computability of a construction of Brownian motion
Mathematical Structures in Computer Science, 2013
We examine a construction due to Fouché in which a Brownian motion is constructed from an algorithmically random infinite binary sequence. We show that although the construction is provably not computable in the sense of computable analysis, a lower bound for the rate of convergence is computable in any upper bound for the compressibilty of the sequence, making the construction layerwise computable.
Latin American journal of probability and mathematical statistics
We study a natural continuous time version of excited random walks, introduced by Norris, Rogers and Williams about twenty years ago. We obtain a necessary and sufficient condition for recurrence and for positive speed. This is analogous to results for excited (or cookie) random walks.