Related papers: When does randomness come from randomness?
Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…
Let $X$ and $Y$ be topological spaces, let $Z$ be a metric space, and let $f: X\times Y\to Z$ be a mapping. It is shown that when $Y$ has a countable base $\mathcal B$, then under a rather general condition on the set-valued mappings $X\ni…
In the spirit of the famous KOML\'OS (1967) theorem, every sequence of nonnegative, measurable functions $\{ f_n \}_{n \in \N}$ on a probability space, contains a subsequence which - along with all its subsequences - converges a.e. in…
Finite Sample Smeariness (FSS) has been recently discovered. It means that the distribution of sample Fr\'echet means of underlying rather unsuspicious random variables can behave as if it were smeary for quite large regimes of finite…
Given a function $F$ transforming a probability measure $\mu$ into another one $F(\mu)$, we study the existence and regularity of a transport representation of it. That is, we ask whether we can represent the image $F(\mu)$ of the input…
The classical Shannon sampling theorem states that a signal f with Fourier transform F in L^2(R) having its support contained in (-\pi,\pi) can be recovered from the sequence of samples (f(n))_{n in Z} via f(t)=\sum_{n in Z} f(n) (sin(\pi…
The Born's rule introduces intrinsic randomness to the outcomes of a measurement performed on a quantum mechanical system. But, if the system is prepared in the eigenstate of an observable then the measurement outcome of that observable is…
We study invariant measures for random countable (finite or infinite) conformal iterated function systems (IFS) with arbitrary overlaps. We do not assume any type of separation condition. We prove, under a mild assumption of finite entropy,…
In this paper, we will generalize the definition of partially random or complex reals, and then show the duality of random and complex, i.e., a generalized version of Levin-Schnorr's theorem. We also study randomness from the view point of…
Let $\Sigma_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We select a partition from the set $\Sigma_{2n}$ uniformly at random. Let $2G_n$ be the number partitioned by…
The Peterson-Thom conjecture asserts that any diffuse, amenable subalgebra of a free group factor is contained in a unique maximal amenable subalgebra. This conjecture is motivated by related results in Popa's deformation/rigidity theory…
A different general philosophy, to be called Full Randomness (FR), for the analysis of random effects models is presented, involving a notion of reducing or preferably eliminating fixed effects, at least formally. For example, under FR…
Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the…
An integer is said to be $y$-friable if its greatest prime factor P(n) is less than $y$. In this paper, we study numbers of the shape $n-1$ when $P(n)\leq y$ and $n\leq x$. One expects that, statistically, their multiplicative behaviour…
Randomness generation through quantum-chaotic evolution underpins foundational questions in statistical mechanics and applications across quantum information science, including benchmarking, tomography, metrology, and demonstrations of…
Given a self-similar set $\Lambda$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $\Lambda$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a…
Quantum mechanics predicts the existence of intrinsically random processes. Contrary to classical randomness, this lack of predictability can not be attributed to ignorance or lack of control. Here we find the optimal method to quantify the…
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…
We consider the sums $T_N=\sum_{n=1}^N F(S_n)$ where $S_n$ is a random walk on $\mathbb Z^d$ and $F:\mathbb Z^d\to \mathbb R$ is a global observable, that is, a bounded function which admits an average value when averaged over large cubes.…
Let \mu be a computable ergodic shift-invariant measure over the Cantor space. Providing a constructive proof of Shannon-McMillan-Breiman theorem, V'yugin proved that if a sequence x is Martin-L\"of random w.r.t. \mu then the strong…