Related papers: Normal numbers and normality measure
Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…
We prove the existence of a limit distribution for the normalized normality measure $\mathcal{N}(E_N)/\sqrt{N}$ (as $N \to \infty$) for random binary sequences $E_N$, by this means confirming a conjecture of Alon, Kohayakawa, Mauduit,…
A real number $x$ is normal with respect to an integer base $b \geq 2$ if its digit expansion in this base is ``equitable'', in the sense that for $k \geq 1$, every ordered sequence of $k$ digits from $\{0, 1, \ldots, b-1\}$ occurs in the…
The notion of a normal bit sequence was introduced by Borel in 1909; it was the first definition of an individual random object. Normality is a weak notion of randomness requiring only that all $2^n$ factors (substrings) of arbitrary…
Gyarmati, Mauduit and S\'ark\"ozy introduced the cross-correlation measure $\Phi_k(G)$ of order $k$ to measure the level of pseudorandom properties of families of finite binary sequences. In an earlier paper we estimated the…
In this paper we study correlation measures introduced in \cite{emme_asymptotic_2017}. Denote by $\mu_a(d)$ the asymptotic density of the set $\mathcal{E}_{a,d}=\{n \in \mathbb{N}, \ s_2(n+a)-s_2(n)=d\}$ (where $s_2$ is the sum-of-digits…
This work is devoted to solving some closely related open problems on the average and asymptotic behavior of the $2$-adic complexity of binary sequences. First, for fixed $N$, we prove that the expected value $E^{\mathrm{2-adic}}_N$ of the…
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…
A real number $x$ is considered normal in an integer base $b \geq 2$ if its digit expansion in this base is ``equitable'', ensuring that for each $k \geq 1$, every ordered sequence of $k$ digits from $\{0, 1, \ldots, b-1\}$ occurs in the…
Mordechay B. Levin has constructed a number $\lambda$ which is normal in base 2, and such that the sequence $(\left\{2^n \lambda\right\})_{n=0,1,2,\ldots}$ has very small discrepancy $D_N$. Indeed we have $N\cdot D_N = \mathcal{O}…
Let ${X_1,...,X_n}$ be i.i.d. random observations. Let $\mathbb{S}=\mathbb{L}+\mathbb{T}$ be a $U$-statistic of order $k\ge2$ where $\mathbb{L}$ is a linear statistic having asymptotic normal distribution, and $\mathbb{T}$ is a…
One can consider $\mu$-Martin-L\"of randomness for a probability measure $\mu$ on $2^{\omega}$, such as the Bernoulli measure $\mu_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^{\omega}$ with parameters $p_0,…
The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order…
A key tool in recent advances in understanding arithmetic progressions and other patterns in subsets of the integers is certain norms or seminorms. One example is the norms on $\Z/N\Z$ introduced by Gowers in his proof of Szemer\'edi's…
We investigate the spectral norms of symmetric $N \times N$ matrices from two pseudo-random ensembles. The first is the pseudo-Wigner ensemble introduced in "Pseudo-Wigner Matrices" by Soloveychik, Xiang and Tarokh and the second is its…
In this paper, we treat the problem of testing for normality as a binary classification problem and construct a feedforward neural network that can successfully detect normal distributions by inspecting small samples from them. The…
The rational base number system, introduced by Akiyama, Frougny, and Sakarovitch in 2008, is a generalization of the classical integer base number system. Within this framework two interesting families of infinite words emerge, called…
Let $A_n=(a_0,a_1,\dots,a_{n-1})$ be drawn uniformly at random from $\{-1,+1\}^n$ and define \[ M(A_n)=\max_{0<u<n}\,\Bigg|\sum_{j=0}^{n-u-1}a_ja_{j+u}\Bigg|\quad\text{for $n>1$}. \] It is proved that $M(A_n)/\sqrt{n\log n}$ converges in…
Given a graph with node attributes, what neighborhoods are anomalous? To answer this question, one needs a quality score that utilizes both structure and attributes. Popular existing measures either quantify the structure only and ignore…
In 1909 Borel defined normality as a notion of randomness of the digits of the representation of a real number over certain base (fractional expansion). If we think the representation of a number over a base as an infinite sequence of…