Related papers: Randomness and uniform distribution modulo one
We give an extension of a criterion of van der Corput on uniform distribution of sequences. Namely, we prove that a sequence $x_n$ is uniformly distributed modulo 1 if it is weakly monotonic and satisfies the conditions $\Delta^2x_n\to…
The main purpose of this paper is to introduce the random tensor with normal distribution, which promotes the matrix normal distribution to a higher order case. Some basic knowledge on tensors are introduced before we focus on the random…
The theory of equidistribution is about hundred years old, and has been developed primarily by number theorists and theoretical computer scientists. A motivated uninitiated peer could encounter difficulties perusing the literature, due to…
We obtain a necessary and sufficient condition for the orthomartingale-coboundary decomposition. We establish a sufficient condition for the approximation of the partial sums of a strictly stationary random fields by those of stationary…
Let $(f_n)_{n=1}^{\infty}$ be a sequence of polynomials and $\alpha>1$. In this paper we study the distribution of the sequence $(f_n(\alpha))_{n=1}^{\infty}$ modulo one. We give sufficient conditions for a sequence $(f_n)_{n=1}^{\infty}$…
Let $M_n$ be a random matrix of size $n\times n$ and let $\lambda_1,...,\lambda_n$ be the eigenvalues of $M_n$. The empirical spectral distribution $\mu_{M_n}$ of $M_n$ is defined as $$\mu_{M_n}(s,t)=\frac{1}{n}# \{k\le n, \Re(\lambda_k)\le…
A well known theorem due to Koksma states that for Lebesgue almost every $x>1$ the sequence $(x^n)_{n=1}^{\infty}$ is uniformly distributed modulo one. In this paper we give sufficient conditions for an analogue of this theorem to hold for…
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure $\lambda $, a choice needs to be made. One approach is to allow randomness tests to access the measure $\lambda $ as an…
This text presents an unified approach of probability and statistics in the pursuit of understanding and computation of randomness in engineering or physical or social system with prediction with generalizability. Starting from elementary…
A concept of randomness for infinite time register machines (ITRMs), resembling Martin-L\"of-randomness, is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies…
Let $f(x)$ be an irreducible polynomial with integer coefficients of degree at least two. Hooley proved that the roots of the congruence equation $f(x)\equiv 0\mod n$ is uniformly distributed. as a parallel of Hooley's theorem under ideal…
A result of Shen says that if $F\colon2^{\mathbb{N}}\rightarrow2^{\mathbb{N}}$ is an almost-everywhere computable, measure-preserving transformation, and $y\in2^{\mathbb{N}}$ is Martin-L\"of random, then there is a Martin-L\"of random…
A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…
A Martin-L\"of test $\mathcal U$ is universal if it captures all non-Martin-L\"of random sequences, and it is optimal if for every ML-test $\mathcal V$ there is a $c \in \omega$ such that $\forall n(\mathcal{V}_{n+c} \subseteq…
The concept of uniform distribution in $[0,1]$ is extended for a certain strictly separated maximal (in the sense of cardinality) family $(\lambda_t)_{t \in [0,1]}$ of invariant extensions of the linear Lebesgue measure $\lambda$ in…
Stochastic expansion-based methods of uncertainty quantification, such as polynomial chaos and separated representations, require basis functions orthogonal with respect to the density of random inputs. Many modern engineering problems…
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…
Martin-Lof's definition of random sequences of cbits as those not belonging to any set of constructive zero Lebesgue measure is reformulated in the language of Algebraic Probability Theory. The adoption of the Pour-El Richards theory of…
We obtain asymptotic expansions for local probabilities of partial sums for uniformly bounded independent but not necessarily identically distributed integer-valued random variables. The expansions involve products of polynomials and…
We establish the unimodality and the asymptotic strong unimodality of the ordinary multinomials and give their smallest mode leading to the expression of the maximal probability of convolution powers of the discrete uniform distribution. We…