Related papers: Randomness and uniform distribution modulo one
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…
We give sufficient conditions for the asymptotic normality of linear combinations of order statistics (L-statistics) in the case of simple random samples without replacement. In the first case, restrictions are imposed on the weights of…
In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p, and use these results to study the distribution of the rank…
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…
We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…
We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…
Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…
Let $\pi(x;q,a)$ denote the number of primes up to $x$ that are congruent to $a$ modulo $q$. A prime number race, for fixed modulus $q$ and residue classes $a_1, \ldots, a_r$, investigates the system of inequalities $\pi(x;q,a_1) >…
We consider a uniform distribution on the set $\mathcal{M}_k$ of moments of order $k \in \mathbb{N}$ corresponding to probability measures on the interval $[0,1]$. To each (random) vector of moments in $\mathcal{M}_{2n-1}$ we consider the…
We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…
We characterize Martin-L\"of randomness and Schnorr randomness in terms of the merging of opinions, along the lines of the Blackwell-Dubins Theorem. After setting up a general framework for defining notions of merging randomness, we focus…
Conditional identity in distribution (Berti et al. (2004)) is a new type of dependence for random variables, which generalizes the well-known notion of exchangeability. In this paper, a class of random sequences, called Generalized Species…
Compositional data arise when count observations are normalised into proportions adding up to unity. To allow use of standard statistical methods, compositional proportions can be mapped from the simplex into the Euclidean space through the…
Let $(X_{n,t})_{t=1}^{\infty}$ be a stationary absolutely regular sequence of real random variables with the distribution dependent on the number~$n$. The paper presents sufficient conditions for the asymptotic normality (for $n\to\infty$…
Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our…
The paper considers quantitative versions of different randomness notions: algorithmic test measures the amount of non-randomness (and is infinite for non-random sequences). We start with computable measures on Cantor space (and Martin-Lof…
Given a probability distribution $\mu$ a set $\Lambda (\mu)$ of positive real numbers is introduced, so that $\Lambda (\mu)$ measures the "divisibility" of $\mu$. The basic properties of $\Lambda (\mu)$ are described and examples of…
We give a new proof that every linear fractional map of the unit ball induces a bounded composition operator on the standard scale of Hilbert function spaces on the ball, and obtain norm bounds analogous to the standard one-variable…
The Bateman--Horn Conjecture predicts how often an irreducible polynomial $f(x) \in \mathbb{Z}[x]$ assumes prime values. We demonstrate that with sufficient averaging in the coefficients of $f$ (viz. exponential in the size of the inputs),…
This paper examines the classical matching distribution arising in the "problem of coincidences". We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed…