English
Related papers

Related papers: The interplay of classes of algorithmically random…

200 papers

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs

A classical question about a metric space is whether Borel measures on the space are determined by their values on balls. We show that for any given measure this property is stable under Gromov-Wasserstein convergence of metric measure…

Algebraic Topology · Mathematics 2024-01-23 Anne van Delft , Andrew J. Blumberg

Let $\alpha_n(\cdot)=P\bigl(X_{n+1}\in\cdot\mid X_1,\ldots,X_n\bigr)$ be the predictive distributions of a sequence $(X_1,X_2,\ldots)$ of $p$-dimensional random vectors. Suppose $$\alpha_n= \mathcal{N} _p (M_n,Q_n)$$ where…

Statistics Theory · Mathematics 2024-09-17 Samuele Garelli , Fabrizio Leisen , Luca Pratelli , Pietro Rigo

Let $n \in \mathbb{Z}_{\geq 3}.$ Given any Borel subset $A$ of $\mathbb{R}^n$ with finite and nonzero measure, we prove that the probability that the set of primitive points of a random full-rank unimodular lattice in $\mathbb{R}^n$ does…

Classical Analysis and ODEs · Mathematics 2021-08-24 Mishel Skenderi

We study the Dvoretzky covering problem for random covering sets driven by general Borel probability measures. As our main result, we solve the problem of covering analytic sets by random covering sets generated by arbitrary Borel…

Probability · Mathematics 2026-01-19 Roope Anttila , Markus Myllyoja

Let $X$ be a Borel subset of the Cantor set \textbf{C} of additive or multiplicative class ${\alpha},$ and $f: X \to Y$ be a continuous function with compact preimages of points onto $Y \subset \textbf{C}.$ If the image $f(U)$ of every…

General Topology · Mathematics 2011-02-17 Alexey Ostrovsky

The framework of this paper is that of risk measuring under uncertainty, which is when no reference probability measure is given. To every regular convex risk measure on ${\cal C}_b(\Omega)$, we associate a unique equivalence class of…

Risk Management · Quantitative Finance 2015-03-17 Jocelyne Bion-Nadal , Magali Kervarec

We study algorithmic randomness properties for probability measures on Cantor space. We say that a measure $\mu$ on the space of infinite bit sequences is ML absolutely continuous if the non-ML-random bit sequences form a null set with…

Logic · Mathematics 2020-10-19 Andre Nies , Frank Stephan

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…

Information Theory · Computer Science 2007-08-20 Marcus Hutter , Andrej Muchnik

Let $\mu$ be a Borel probability measure on a compact path-connected metric space $(X, \rho)$ for which there exist constants $c,\beta>1$ such that $\mu(B) \geq c r^{\beta}$ for every open ball $B\subset X$ of radius $r>0$. For a class of…

Numerical Analysis · Mathematics 2021-05-07 Martin Buhmann , Feng Dai , Yeli Niu

A semi-measure is a generalization of a probability measure obtained by relaxing the additivity requirement to super-additivity. We introduce and study several randomness notions for left-c.e. semi-measures, a natural class of effectively…

Logic · Mathematics 2017-10-18 Laurent Bienvenu , Rupert Hölzl , Christopher P. Porter , Paul Shafer

The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a…

Logic in Computer Science · Computer Science 2019-03-08 Thomas Powell , Peter M Schuster , Franziskus Wiesnet

For the iterations of $x\mapsto |x-\theta|$ random functions with Lipschitz number one, we represent the dynamics as a Markov chain and prove its convergence under mild conditions. We also demonstrate that the Wasserstein metric of any two…

Probability · Mathematics 2024-09-11 Yingdong Lu , Tomasz Nowicki

In this article, we introduce a formal definition of the concept of probability tree and conduct a detailed and comprehensive study of its fundamental structural properties. In particular, we define what we term an inductive probability…

Probability · Mathematics 2025-01-22 Diego A. Mejía , Andrés F. Uribe-Zapata

Let $C$ be an open cone in a Banach space equipped with the Thompson metric with closure a normal cone. The main result gives sufficient conditions for Borel probability measures $\mu,\nu$ on $C$ with finite first moment for which $\mu\leq…

Probability · Mathematics 2016-12-13 Jimmie Lawson

This article constructs a class of random probability measures based on exponentially and polynomially tilting operated on the laws of completely random measures. The class is proved to be conjugate in that it covers both prior and…

Statistics Theory · Mathematics 2013-12-19 John W. Lau

In this article we provide a proof of the so called absolute continuity theorem for random dynamical systems on $R^d$ which have an invariant probability measure. First we present the construction of local stable manifolds in this case.…

Probability · Mathematics 2014-01-07 Moritz Biskamp

This expository paper advocates an approach to physics in which ``typicality" is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and physics are reviewed. Their original versions…

Mathematical Physics · Physics 2023-09-06 Klaas Landsman

We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…

Probability · Mathematics 2008-06-13 Andreas Greven , Peter Pfaffelhuber , Anita Winter

Let $U$ be a Morse function on a compact connected $m$-dimensional Riemannian manifold, $m \geq 2,$ satisfying $\min U=0$ and let $\mathcal{U} = \{x \in M \: : U(x) = 0\}$ be the set of global minimizers. Consider the stochastic algorithm…

Probability · Mathematics 2024-01-24 Michel Benaïm , Laurent Miclo