Related papers: Normal numbers and normality measure

Let $X_{1},X_{2},...$ be a sequence of independent copies (s.i.c) of a real random variable (r.v.) $X\geq 1$, with distribution function $df$ $F(x)=\mathbb{P}% (X\leq x)$ and let $X_{1,n}\leq X_{2,n} \leq ... \leq X_{n,n}$ be the order…

Nowadays, the notion of semi-regular sequences, originally proposed by Fr\"oberg, becomes very important not only in Mathematics, but also in Information Science, in particular Cryptology. For example, it is highly expected that randomly…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

We first compare several algebraic notions of normality, from a categorical viewpoint. Then we introduce an intrinsic description of Higgins' commutator for ideal-determined categories, and we define a new notion of normality in terms of…

We revisit the outlier hypothesis testing framework of Li \emph{et al.} (TIT 2014) and derive fundamental limits for the optimal test under the generalized Neyman-Pearson criterion. In outlier hypothesis testing, one is given multiple…

The normalised volume measure on the $\ell_p^n$ unit ball ($1\leq p\leq 2$) satisfies the following isoperimetric inequality: the boundary measure of a set of measure $a$ is at least $cn^{1/p}\tilde{a}\log^{1-1/p}(1/\tilde{a})$, where…

Consider Ginibre's ensemble of $N \times N$ non-Hermitian random matrices in which all entries are independent complex Gaussians of mean zero and variance $\frac{1}{N}$. As $N \uparrow \infty$ the normalized counting measure of the…

We consider whether minimizers for total variation regularization of linear inverse problems belong to $L^\infty$ even if the measured data does not. We present a simple proof of boundedness of the minimizer for fixed regularization…

The many-normal-means problem is a classic example that motivates the development of many important inferential procedures in the history of statistics. In this short note, we consider a further special case of the problem, which involves…

Let $E$ be a Moran set on $\mathbb{R}^1$ associated with a closed interval $J$ and two sequences $(n_k)_{k=1}^\infty$ and $(\mathcal{C}_k=(c_{k,j})_{j=1}^{n_k})_{k\geq1}$. Let $\mu$ be the infinite product measure (Moran measure) on $E$…

We consider a natural measure of relevance: the reduction in optimal prediction risk in the presence of side information. For any given loss function, this relevance measure captures the benefit of side information for performing inference…

Let s be an integer greater than or equal to 2. A real number is simply normal to base s if in its base-s expansion every digit 0, 1, ..., s-1 occurs with the same frequency 1/s. Let X be the set of positive integers that are not perfect…

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…

We study a state estimation problem for a $2\times 2$ linear hyperbolic system on networks with eigenvalues with opposite signs. The system can be seen as a simplified model for gas flow through gas networks. For this system we construct an…

The modularity of a graph is a parameter that measures its community structure; the higher its value (between $0$ and $1$), the more clustered the graph is. In this paper we show that the modularity of a random $3$-regular graph is at least…

We present the first efficient averaging sampler that achieves asymptotically optimal randomness complexity and near-optimal sample complexity. For any $\delta < \varepsilon$ and any constant $\alpha > 0$, our sampler uses $m + O(\log (1 /…

We study the minimal sample size N=N(n) that suffices to estimate the covariance matrix of an n-dimensional distribution by the sample covariance matrix in the operator norm, with an arbitrary fixed accuracy. We establish the optimal bound…

We introduce a regularity method for sparse graphs, with new regularity and counting lemmas which use the Schatten-von-Neumann norms to measure uniformity. This leads to $k$-cycle removal lemmas in subgraphs of mildly-pseudorandom graphs,…

We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.

In a previous paper, the authors introduced several vector space norms on the space of algebraic numbers modulo torsion which corresponded to the Mahler measure on a certain class of numbers and allowed the authors to formulate L^p Lehmer…