Related papers: Digits of pi: limits to the seeming randomness II
In this article, we try to give an answer to the simple question: ``\textit{What is the critical growth rate of the dimension $p$ as a function of the sample size $n$ for which the Central Limit Theorem holds uniformly over the collection…
We prove a Central Limit Theorem for probability measures defined via the variation of the sum-of-digits function, in base $b\ge 2$. For $r\ge 0$ and $d \in \mathbb{Z}$, we consider $\mu^{(r)}(d)$ as the density of integers $n\in…
Let $\mathbf{R}$ be the sample correlation matrix constructed from $\mathbf{X}\in \mathbb{R}^{p\times n}$, whose entries are independent and identically distributed random variables with mean zero and tail probability condition…
We analyze the fluctuations of incomplete $U$-statistics over a triangular array of independent random variables. We give criteria for a Central Limit Theorem (CLT, for short) to hold in the sense that we prove that an appropriately scaled…
Nature and our world have a bias! Roughly $30\%$ of the time the number $1$ occurs as the leading digit in many datasets base $10$. This phenomenon is known as Benford's law and it arrises in diverse fields such as the stock market,…
Consider the sample covariance matrix $$\Sigma^{1/2}XX^T\Sigma^{1/2}$$ where $X$ is an $M\times N$ random matrix with independent entries and $\Sigma$ is an $M\times M$ diagonal matrix. It is known that if $\Sigma$ is deterministic, then…
We consider $n\times n$ real symmetric and Hermitian Wigner random matrices $n^{-1/2}W$ with independent (modulo symmetry condition) entries and the (null) sample covariance matrices $n^{-1}X^*X$ with independent entries of $m\times n$…
This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of…
An algorithm for sampling exactly from the normal distribution is given. The algorithm reads some number of uniformly distributed random digits in a given base and generates an initial portion of the representation of a normal deviate in…
We study the typical behavior of the size of the ratio set $A/A$ for a random subset $A\subset \{1,\dots , n\}$. For example, we prove that $|A/A|\sim \frac{2\text{Li}_2(3/4)}{\pi^2}n^2 $ for almost all subsets $A \subset\{1,\dots ,n\}$. We…
To analyse the significance of the digits used for interval bounds, we clarify the philosophical presuppositions of various interval notations. We use information theory to determine the information content of the last digit of the numeral…
Statistical inferences for sample correlation matrices are important in high dimensional data analysis. Motivated by this, this paper establishes a new central limit theorem (CLT) for a linear spectral statistic (LSS) of high dimensional…
In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.
That the logarithmic distribution manifests itself in the random as well as in the deterministic (multiplication processes) has long intrigued researchers in Benford's Law. In this article it is argued that it springs from one common…
Benford's law states that for many random variables X > 0 its leading digit D = D(X) satisfies approximately the equation P(D = d) = log_{10}(1 + 1/d) for d = 1,2,...,9. This phenomenon follows from another, maybe more intuitive fact,…
We observe that a probability distribution supported by $\mathbb{N}$, induces a representation of real numbers in [0, 1) with digits in $\mathbb{N}$. We first study the Hausdorff dimension of sets with prescribed digits with respect to…
Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…
This paper studies a well-known $\pi$ machine illustrated by Fig.(1). It is shown that the $\pi$ machine can compute digits of $\pi$ if the ratio of block weights, $m_2/m_1$, satisfies certain conditions, and that dynamics of the $\pi$…
This paper describes recent advances in the combinatorial method for computing $\pi(x)$, the number of primes $\leq x$. In particular, the memory usage has been reduced by a factor of $\log x$, and modifications for shared- and…
Associated to each complex-valued random variable satisfying appropriate integrability conditions, we introduce a different generalization of the Stirling numbers of the second kind. Various equivalent definitions are provided. Attention,…