Related papers: Algorithmic randomness for Doob's martingale conve…
This paper extends classical probabilistic results to the broader class of demimartingales and demisubmartingales. We establish variants of Doob's-type optional sampling theorem under minimal structural conditions on stopping times, relying…
Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various martingale-based methods for over- and under-approximating…
The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…
When analyzing probabilistic computations, a powerful approach is to first find a martingale---an expression on the program variables whose expectation remains invariant---and then apply the optional stopping theorem in order to infer…
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Martin-Loef randomness and computable randomness. The latter…
We correct Miyabe's proof of van Lambalgen's Theorem for truth-table Schnorr randomness (which we will call uniformly relative Schnorr randomness). An immediate corollary is one direction of van Lambalgen's theorem for Schnorr randomness.…
This is a survey of constructive and computable measure theory with an emphasis on the close connections with algorithmic randomness. We give a brief history of constructive measure theory from Brouwer to the present, emphasizing how…
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…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
Doob's theorem provides guarantees of consistent estimation and posterior consistency under very general conditions. Despite the limitation that it only guarantees consistency on a set with prior probability 1, for many models arising in…
In this paper, martingales related to simple random walks and their maximum process are investigated. First, a sufficient condition under which a function with three arguments, time, the random walk, and its maximum process becomes a…
A concept of randomness for infinite time register machines (ITRMs), resembling Martin-L\"of-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies…
In this paper, using martingale techniques, we prove a generalization of Doob's maximal identity in the setting of continuous nonnegative local submartingales $(X_{t})$ of the form: $X_{t}=N_{t}+A_{t}$, where the measure $(dA_{t})$ is…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…
We use the martingale-theoretic approach of game-theoretic probability to incorporate imprecision into the study of randomness. In particular, we define several notions of randomness associated with interval, rather than precise,…
The van Lambalgen theorem is a surprising result in algorithmic information theory concerning the symmetry of relative randomness. It establishes that for any pair of infinite sequences $A$ and $B$, $B$ is Martin-L\"of random and $A$ is…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using the Taylor expansion, is…
We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…