Related papers: Randomized Computation of Continuous Data: Is Brow…
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\"of random with respect to the Wiener…
Let $X_t = B_t + \mu t$, $t \geq 0$, be planar Brownian motion with nonzero drift, and let $K_t^r = \{x \in \mathbb{R}^2 : {\rm dist}(x, X[0,t]) \leq r\}$ be the radius-$r$ Wiener sausage up to time $t$. For a bounded Borel function $\psi$…
Suppose $B$ is a Brownian motion and $B^n$ is an approximating sequence of rescaled random walks on the same probability space converging to $B$ pointwise in probability. We provide necessary and sufficient conditions for weak and strong…
We introduce the model of two-dimensional continuous random interlacements, which is constructed using the Brownian trajectories conditioned on not hitting a fixed set (usually, a disk). This model yields the local picture of Wiener sausage…
Generative Modelling has become a promising use case for near term quantum computers. In particular, due to the fundamentally probabilistic nature of quantum mechanics, quantum computers naturally model and learn probability distributions,…
We investigate the Brown measures of compressions of $R$-diagonal random variables, extending previous results to include unbounded cases. For random variables with finite variance, we demonstrate that the Brown measures of their…
We study when a given Gaussian random variable on a given probability space $(\Omega, {\cal{F}}, P) $ is equal almost surely to $\beta_{1}$ where $\beta $ is a Brownian motion defined on the same (or possibly extended) probability space. As…
We consider a Brownian particle moving on a ring. We study the probability distributions of the total number of turns and the net number of counter-clockwise turns the particle makes till time t. Using a method based on the renewal…
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a…
This paper establishes a non-stochastic analogue of the celebrated result by Dubins and Schwarz about reduction of continuous martingales to Brownian motion via time change. We consider an idealized financial security with continuous price…
This paper presents a novel generic asymptotic expansion formula of expectations of multidimensional Wiener functionals through a Malliavin calculus technique. The uniform estimate of the asymptotic expansion is shown under a weaker…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
Motivated by quantum information theory, we introduce a dynamical random state built out of the sum of $k \geq 2$ independent unitary Brownian motions. In the large size limit, its spectral distribution equals, up to a normalising factor,…
We compare two examples of random dense countable sets, `Brownian local minima' and `unordered uniform infinite sample'. They appear to be identically distributed. A framework for such notions is proposed. In addition, random elements of…
We present a perturbation theory by extending a prescription due to Feynman for computing the probability density function for the random flight motion. The method can be applied to a wide variety of otherwise difficult circumstances. The…
In this work we introduce correlated random walks on $\Z$. When picking suitably at random the coefficient of correlation, and taking the average over a large number of walks, we obtain a discrete Gaussian process, whose scaling limit is…
We use the martingale-theoretic approach of game-theoretic probability to incorporate imprecision into the study of randomness. In particular, we define a notion of computable randomness associated with interval, rather than precise,…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We study the persistent homology of the offset filtration generated by the range of a planar Brownian motion with constant nonzero drift. The members of this filtration are the Wiener sausages of increasing radius, and the degree-one…
We study Doob's Consistency Theorem and Freedman's Inconsistency Theorem from the vantage point of computable probability and algorithmic randomness. We show that the Schnorr random elements of the parameter space are computably consistent,…