Related papers: Again, random numbers fall mainly in the planes: x…
Agent-based models (ABMs) are widely used to estimate causal treatment effects via paired counterfactual simulation. A standard variance reduction technique is common random numbers (CRNs), which couples replicates across intervention…
"A generator is a parser of randomness." This perspective on generators for random data structures is well established as folklore in the programming languages community, but it has apparently never been formalized, nor have its…
We present a simple approach to realize truly random number generation based on measurement of the phase noise of a single mode vertical cavity surface emitting laser (VCSEL). The true randomness of the quantum phase noise originates from…
Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on…
As a kind of basic machine learning method, clustering algorithms group data points into different categories based on their similarity or distribution. We present a clustering algorithm by finding hyper-planes to distinguish the data…
A new approach to the generation of random sequences and two dimensional random patterns is proposed in this paper in which random sequences are generated by making use of either Delaunay triangulation or Voronoi diagrams drawn from random…
In this paper, we present a universal scheme for transforming an arbitrary algorithm for biased 2-face coins to generate random bits from the general source of an m-sided die, hence enabling the application of existing algorithms to general…
A systematic study of the probability distribution of superimposed random codes is presented through the use of generating functions. Special attention is paid to the cases of either uniformly distributed but not necessarily independent or…
A novel fast recursive coding technique is proposed. It operates with only integer values not longer 8 bits and is multiplication free. Recursion the algorithm is based on indirectly provides rather effective coding of symbols for very…
Programs with floating-point computations are often derived from mathematical models or designed with the semantics of the real numbers in mind. However, for a given input, the computed path with floating-point numbers may differ from the…
Machine learning (ML) frameworks rely heavily on pseudorandom number generators (PRNGs) for tasks such as data shuffling, weight initialization, dropout, and optimization. Yet, the statistical quality and reproducibility of these…
Random numbers are important in many activities, including communication, encryption, science, gambling, finance, and decision-making. There is a strong demand for a hardware random number generator that could support cryptographic…
A C library for random number generation, Randompack, is presented. The library implements several modern random number generators (engines), including xoshiro256, PCG64, Philox, ranlux++, and sfc64; 14 continuous distributions including…
Quantum random number generators are a burgeoning technology used for a variety of applications, including modern security and encryption systems. Typical methods exploit an entropy source combined with an extraction or bit generation…
It is shown how correlations in the generalized feedback shift-register (GFSR) random-number generator are greatly diminished when the number of feedback taps is increased from two to four (or more) and the tap offsets are lengthened.…
The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions…
Quantum random number generation is a technique to generate random numbers by extracting randomness from specific quantum processes. As for practical random number generators, they are required not only to have no information leakage but…
We introduce a new variant of Nodal Virtual Element spaces that mimics the "Serendipity Finite Element Methods" (whose most popular example is the 8-node quadrilateral) and allows to reduce (often in a significant way) the number of…
The logistic map is one of the simple systems exhibiting order to chaos transition. In this work we have investigated the possibility of using the logistic map in the chaotic regime ({\sc logmap}) for a pseudo random number generator. To…
We present an intriguing discovery related to Random Fourier Features: in Gaussian kernel approximation, replacing the random Gaussian matrix by a properly scaled random orthogonal matrix significantly decreases kernel approximation error.…