Related papers: Normal numbers and normality measure

It is well known that the independence of the sample mean and the sample variance characterizes the normal distribution. By using Anosov's theorem, we further investigate the analogous characteristic properties in terms of the sample mean…

In the present paper we extend Champernowne's construction of normal numbers to provide sequences which are generic for a given invariant probability measure, which need not be the maximal one. We present a construction together with…

This paper deals with the numerical approximation of normalizing constants produced by particle methods, in the general framework of Feynman-Kac sequences of measures. It is well-known that the corresponding estimates satisfy a central…

A number is normal in base $b$ if, in its base $b$ expansion, all blocks of digits of equal length have the same asymptotic frequency. The rate at which a number approaches normality is quantified by the classical notion of discrepancy,…

We provide a numerical scheme to approximate as closely as desired the Gaussian or exponential measure $\mu(\om)$ of (not necessarily compact) basic semi-algebraic sets$\om\subset\R^n$. We obtain two monotone (non increasing and non…

The problem of sequential anomaly detection and identification is considered, where multiple data sources are simultaneously monitored and the goal is to identify in real time those, if any, that exhibit ``anomalous" statistical behavior.…

Order statistics theory is applied in this paper to probabilistic robust control theory to compute the minimum sample size needed to come up with a reliable estimate of an uncertain quantity under continuity assumption of the related…

In this note we present an algorithm to obtain a uniform lower bound on Hausdorff dimension of the stationary measure of an affine iterated function scheme with similarities, the best known example of which is Bernoulli convolution. The…

We are interested in the set of normal sequences in the space $\{0,1\}^\mathbb{N}$ with a given frequency of the pattern $11$ in the positions $k, 2k$. The topological entropy of such sets is determined.

In 1961 Erd\H{o}s and Hajnal introduced the quantity $m(n)$ as the minimum number of edges in an $n$-uniform hypergraph with chromatic number at least 3. The best known lower and upper bounds for $ m(n) $ are $ c_1 \sqrt{\frac{n}{\ln n}}…

It is a classical fact that for any $\varepsilon > 0$, a random permutation of length $n = (1 + \varepsilon) k^2 / 4$ typically contains a monotone subsequence of length $k$. As a far-reaching generalization, Alon conjectured that a random…

Several different versions of the theory of numerosities have been introduced in the literature. Here, we unify these approaches in a consistent frame through the notion of set of labels, relating numerosities with the Kiesler field of…

We study the properties of several likelihood-based statistics commonly used in testing for the presence of a known signal under a mixture model with known background, but unknown signal fraction. Under the null hypothesis of no signal, all…

We prove new lower bounds on the modularity of graphs. Specifically, the modularity of a graph $G$ with average degree $\bar d$ is $\Omega(\bar{d}^{-1/2})$, under some mild assumptions on the degree sequence of $G$. The lower bound…

We derive explicit bounds for the computation of normalizing constants $Z$ for log-concave densities $\pi = \exp(-U)/Z$ with respect to the Lebesgue measure on $\mathbb{R}^d$. Our approach relies on a Gaussian annealing combined with recent…

We construct exact confidence intervals for the average treatment effect in randomized experiments with binary outcomes using sequences of randomization tests. Our approach does not rely on large-sample approximations and is valid for all…

We use a system of first-order partial differential equations that characterize the moment generating function of the $d$-variate standard normal distribution to construct a class of affine invariant tests for normality in any dimension. We…

Define $||n||$ to be the \emph{complexity} of $n$, which is the smallest number of $1$s needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $||n|| \geq 3\log_3 n$ for all $n$.…

Normality arguments are applied to study the oscillation of solutions of $f''+Af=0$, where the coefficient $A$ is analytic in the unit disc $\mathbb{D}$ and $\sup_{z\in\mathbb{D}} (1-|z|^2)^2|A(z)| < \infty$. It is shown that such…

Let $A$ be an $n\times n$ real matrix, and let $M$ be an $n\times n$ random matrix whose entries are i.i.d sub-Gaussian random variables with mean $0$ and variance $1$. We make two contributions to the study of $s_n(A+M)$, the smallest…