Related papers: Randomness and uniform distribution modulo one
We show that the sequence $(\alpha n)_{n\in \mathcal{B}}$ is uniformly distributed modulo 1, for every irrational $\alpha$, provided $\mathcal{B}$ belongs to a certain family of integer sequences, which includes the prime, almost prime,…
We propose results of the investigation of properties of the random sums of random variables. We consider the case, where the number of summands is the first moment of an event occurrence. An integral equation is presented that determines…
We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…
A sufficient condition for the uniform modulus of continuity of a random field $X = \{X(t), t \in \R^N\}$ is provided. The result is applicable to random fields with heavy-tailed distribution such as stable random fields.
We present necessary and sufficient conditions on systems of random variables for them to possess a lacunary subsystem equivalent in distribution to the Rademacher system on the segment [0,1]. In particular, every uniformly bounded…
An ordinal pattern for a finite sequence of real numbers is a permutation that records the relative positions in the sequence. For random walks with steps drawn uniformly from $[-1,1]$, we show an ordinal pattern occurs with probability…
Let X be a real or complex Hilbert space of finite but large dimension d, let S(X) denote the unit sphere of X, and let u denote the normalized uniform measure on S(X). For a finite subset B of S(X), we may test whether it is approximately…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
Given a prime $p$, let $P(t)$ be a non-constant monic polynomial in $t$ over the ring $\mathbb{Z}_{p}$ of $p$-adic integers. Let $X_{n}$ be an $n \times n$ random matrix over $\mathbb{Z}_{p}$ with independent entries that lie in any residue…
We study a generalization of the Wigner function to arbitrary tuples of hermitian operators. We show that for any collection of hermitian operators A1...An , and any quantum state there is a unique joint distribution on R^n, with the…
This paper examines the distribution of order statistics taken from simple-random-sampling without replacement (SRSWOR) from a finite population with values 1,...,N. This distribution is a shifted version of the beta-binomial distribution,…
It is known that if X is uniformly distributed modulo 1 and Y is an arbitrary random variable independent of X then Y+X is also uniformly distributed modulo 1. We prove a converse for any continuous random variable Y (or a reasonable…
The problem of characterizing a multivariate distribution of a random vector using examination of univariate combinations of vector components is an essential issue of multivariate analysis. The likelihood principle plays a prominent role…
In this note we want to have another look on Schwinger-Dyson equations for the eigenvalue distributions and the fluctuations of classical unitarily invariant random matrix models. We are exclusively dealing with one-matrix models, for which…
For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…
We consider the modulation of data given by random vectors $X_n \in \mathbb{R}^{d_n}$, $n \in \mathbb{N}$. For each $X_n$, one chooses an independent modulating random vector $\Xi_n \in \mathbb{R}^{d_n}$ and forms the projection $Y_n =…
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…
We show that if an essentially arbitrary sequence supported on an interval containing $x$ integers, is convolved with a tiny Siegel-Walfisz-type sequence supported on an interval containing $\exp((\log x)^{\varepsilon})$ integers then the…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…