Related papers: Effective Randomness for Continuous Measures
A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…
In relation to the Erd\H os similarity problem (show that for any infinite set $A$ of real numbers there exists a set of positive Lebesgue measure which contains no affine copy of $A$) we give some new examples of infinite sets which are…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
The hypothesis of randomness is fundamental in statistical machine learning and in many areas of nonparametric statistics; it says that the observations are assumed to be independent and coming from the same unknown probability…
By Easton's theorem one can force the exponential function on regular cardinals to take rather arbitrary cardinal values provided monotonicity and Koenig's lemma are respected. In models without choice we employ a "surjective" version of…
The paper addresses the question whether a random functional, a map from a set $E$ into the space of real-valued measurable functions on a probability space, has a measurable version with values in ${\mathbb R}^E$. Similarly, one may ask…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…
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…
We study existence and uniqueness of invariant probability measures for continuous-time Markov processes on general state spaces. Existence is obtained from tightness of time averages under a weak regularity assumption inspired by…
Stochastic optimization algorithms have become indispensable in modern machine learning. An unresolved foundational question in this area is the difference between with-replacement sampling and without-replacement sampling -- does the…
In \cite{F}, Faith asked for what rings $R$ does the Dual Baer Criterion hold in Mod-$R$, that is, when does $R$-projectivity imply projectivity for all right $R$-modules? Such rings $R$ were called right testing. Sandomierski proved that…
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…
We introduce probability estimation, a broadly applicable framework to certify randomness in a finite sequence of measurement results without assuming that these results are independent and identically distributed. Probability estimation…
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…
We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…
Randomness is a central concept to statistics and physics. Here, a statistical analysis shows experimental evidence that tossing coins and finding last digits of prime numbers are identical regarding statistics for equally likely outcomes.…
The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how…
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
Let f be a computable function from finite sequences of 0's and 1's to real numbers. We prove that strong f-randomness implies strong f-randomness relative to a PA-degree. We also prove: if X is strongly f-random and Turing reducible to Y…
When an experimentalist measures a time series of qubits, the outcomes generate a classical stochastic process. We show that measurement induces high complexity in these processes in two specific senses: they are inherently unpredictable…