Related papers: On testing pseudorandom generators via statistical…
The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random…
We study the empirical measure associated to a sample of size $n$ and modified by $N$ iterations of the raking-ratio method. This empirical measure is adjusted to match the true probability of sets in a finite partition which changes each…
In recent years there has been substantial development in algorithms for quantum phase estimation. In this work we provide a new approach to online Bayesian phase estimation that achieves Heisenberg limited scaling that requires…
We use a set of Schwinger-Dyson equations for the Ising Model to check several random number generators. For the model in two and three dimensions, it is shown that the equations are sensitive tests of bias originated by the random numbers.…
Let $\mu$ be a probability measure on $\text{GL}_d(\mathbb R)$ and denote by $S_n:= g_n \cdots g_1$ the associated random matrix product, where $g_j$'s are i.i.d.'s with law $\mu$. We study statistical properties of random variables of the…
Random number generators (RNGs) are notoriously challenging to build and test, especially for cryptographic applications. While statistical tests cannot definitively guarantee an RNG's output quality, they are a powerful verification tool…
Let (Zn) be a branching process with immigration in an independent and identically distributed random environment. Under necessary moment conditions, we show the exact convergence rate in the central limit theorem on logZn by using the…
Let $T$ be a general sampling statistic that can be written as a linear statistic plus an error term. Uniform and non-uniform Berry--Esseen type bounds for $T$ are obtained. The bounds are the best possible for many known statistics.…
This paper investigates a statistical procedure for testing the equality of two independently estimated covariance matrices when the number of potentially dependent data vectors is large and proportional to the size of the vectors, that is,…
Consider a random walk $S_i= \xi_1+\ldots+\xi_i$, $i\in\mathbb N$, whose increments $\xi_1,\xi_2,\ldots$ are independent identically distributed random vectors in $\mathbb R^d$ such that $\xi_1$ has the same law as $-\xi_1$ and $\mathbb…
Approximate Bayesian computation (ABC) is a widely used inference method in Bayesian statistics to bypass the point-wise computation of the likelihood. In this paper we develop theoretical bounds for the distance between the statistics used…
In this paper, we address the question of comparison between populations of trees. We study an statistical test based on the distance between empirical mean trees, as an analog of the two sample z statistic for comparing two means. Despite…
We introduce a set of tools which simplify and streamline the proofs of limit theorems concerning near-critical particles in branching random walks under optimal assumptions. We exemplify our method by giving another proof of the…
Fix an irrational number $\alpha$. Let $X_1,X_2,\cdots$ be independent, identically distributed, integer-valued random variables with characteristic function $\varphi$, and let $S_n=\sum_{i=1}^n X_i$ be the partial sums. Consider the random…
Internet communication systems involving cryptography and data hiding often require billions of random numbers. In addition to the speed of the algorithm, the quality of the pseudo-random number generator and the ease of its implementation…
In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…
As an extension of a central limit theorem established by Svante Janson, we prove a Berry-Esseen inequality for a sum of independent and identically distributed random variables conditioned by a sum of independent and identically…
Approximate Bayesian Computation (ABC) is a popular method for approximate inference in generative models with intractable but easy-to-sample likelihood. It constructs an approximate posterior distribution by finding parameters for which…
Approximate Bayesian computation (ABC) has become an essential part of the Bayesian toolbox for addressing problems in which the likelihood is prohibitively expensive or entirely unknown, making it intractable. ABC defines a…
The two-parameter Birnbaum-Saunders distribution has been used succesfully to model fatigue failure times. Although censoring is typical in reliability and survival studies, little work has been published on the analysis of censored data…