Skip to content
Preprint

Information on trajectories: martingales and random times

Aug 2026 · 0 citations
Mathematics Computer Science

Abstract

Accounting for information flow on the path space of trajectories of a nonnegative martingale yields exact variational identities for it, even at arbitrary random times. This recovers the widely used classical concentration inequalities, from Ville to PAC-Bayes, and measures what each one discards. The tail a bound controls is itself a relative entropy, resolved by the chain rule into per-step conditional divergences. The discarded slack has an exact form in each of three geometries: a Gibbs tilt for the Azuma-Hoeffding and PAC-Bayes bounds, the crossing itself for Ville's and for pooled tests, and a dominating certificate for the $L^p$ maximal bound. That certificate's optional-stopping deficit resolves per step into Bregman divergences of the running maximum. On a path-time space, the same identity gains one factor that prices anticipation: an arbitrary random time carries an e-process ``peeking penalty.''The partition function can be read as a coalescent--a prefix-sharing probability of independent copies--and geometric mixtures of test martingales gain a pooling benefit for multi-model safe testing.

View source

Similar papers

Preprint Aug 2026

Exit Times for Brownian Motion and Location Detection

In 2023, Wyman and Xi asked ``Can you hear your location on a manifold?''We pose a related question, asking if probabilistic data can be used to recover location within a manifold. More precisely, we ask if location can be recovered from the distribution of exit times of Brownian sample paths. We show that exit time mo...

Cole Kratz, J. Langford · 0 citations
Preprint Sep 2026

Markovization of Randomized Stopping Times

We study randomized stopping times for a Markov process, described by a progressively measurable intensity $\alpha_t(\omega)$. We prove that every admissible intensity has a Markovian representative $\lambda(t,X_t)$, explicitly obtained from the observed measure and the surviving occupation measure. This representative...

Kirill Sokolov · 0 citations
Preprint Sep 2026

Interval-Constrained Brownian Paths: Exact Interpolation and Extrapolation

We study Brownian motion and Brownian bridge processes conditioned to remain in a fixed interval $[0,a]$, focusing on the conditional distribution at a single time. For a Brownian motion in $[0,a]$, conditioned on survival up to time $t$ we recall (and present in a self-contained form) the conditional density of its po...

Radu Herbei, Kumar Somnath · 1 citation
Preprint Sep 2026

An information identity reveals the geometry of deviation events

In a deviation event, the empirical measure of $n$ independent draws lands in a set of distributions. The exponent of its probability splits, at every $n$, into two nonnegative terms. The first is the rate: $n$ times the relative entropy, from the population, of the distribution of a typical draw under the event. The s...

Akshay Balsubramani · 0 citations
Preprint Sep 2026

Support of Dyson Brownian Motion

We consider beta-Dyson Brownian motion, with $\beta>= 1$, started from a deterministic configuration with uniformly bounded support. Let $\mu_t$ be the semicircular free-convolution flow issued from the initial empirical measure, and set $S_t = supp(\mu_t)$. For every fixed $T, \epsilon>0$, with probability at least $1...

Jiaoyang Huang, Sheng-Jing Xu · 0 citations
Preprint Aug 2026

Penalisation of Two-Dimensional Brownian Motion

We study a penalisation problem for two-dimensional Brownian motion. Starting from the Wiener measure, we consider a family of probability measures obtained by weighting paths by a nonnegative functional $F_t$ depending on $t \geq 0$, $F_t$ being measurable with respect to the $\sigma$-algebra generated by the path up...

Joseph Najnudel, Thammadol Tansrivorarat · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.