Related papers: Pseudorandom Number Generators and the Square Site…
Quantum random number generator harnesses the power of quantum mechanics to generate true random numbers, making it valuable for various scientific applications. However, real-world devices often suffer from imperfections that can undermine…
We propose algorithms for construction and random generation of hypergraphs without loops and with prescribed degree and dimension sequences. The objective is to provide a starting point for as well as an alternative to Markov chain Monte…
A sliding-window algorithm of window size $t$ is an algorithm whose current operation depends solely on the last $t$ symbols read. We construct pseudorandom generators (PRGs) for low-space randomized sliding-window algorithms that have…
We calculate the scaling exponents of the two-dimensional correlated percolation cluster's hull and unscreened perimeter. Correlations are introduced through an underlying correlated random potential, which is used to define the state of…
We propose a technique to effectively sample initial neutron and delayed neutron precursor particles for Monte Carlo (MC) simulations of typical off-critical reactor transients. The technique can be seen as an improvement, or alternative,…
In a random ray method of neutral particle transport simulation, each iteration begins by sampling a set of rays before proceeding to solve the characteristic transport equation along the linear paths the rays follow. Historically,…
Percolation phenomena of homopolymer brushes on a planar substrate are simulated using the molecular Monte Carlo method in 3 dimensions. The grafted polymers are isolated from each other at extremely low grafting density, whereas a…
Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to…
We discuss two important techniques, series expansion and Monte Carlo simulation, for random sequential adsorption study. Random sequential adsorption is an idealization for surface deposition where the time scale of particle relaxation is…
The more exact upper estimate of the percolation threshold for the {\it site problem} on the quadratic lattice ${\Bbb Z}^2$ have been found on the basis of the cluster decomposition. It is done by the number estimate of cycles on ${\Bbb…
Cryptographic random number generation is critical for any quantum safe encryption. Based on the natural uncertainty of some quantum processes, variety of quantum random number generators or QRNGs have been created with physical quantum…
The Monte Carlo differential operator sampling method is applied to the computation of sensitivity coefficients of unresolved resonance probability table cross sections. Three new analytical benchmarks for verifying unresolved resonance…
Security of information transmitted through the Internet, against passive or active attacks is an international concern. The use of a chaos-based pseudo-random bit sequence to make it unrecognizable by an intruder, is a field of research in…
Estimating the unknown density from which a given independent sample originates is more difficult than estimating the mean, in the sense that for the best popular non-parametric density estimators, the mean integrated square error converges…
The theory underlying a proposed random number generator for numerical simulations in elementary particle physics and statistical mechanics is discussed. The generator is based on an algorithm introduced by Marsaglia and Zaman, with an…
A generator of spatio-temporal pseudo-random Gaussian fields that satisfy the "proportionality of scales" property (Tsyroulnikov, 2001) is presented. The generator is based on a third-order in time stochastic differential equation with a…
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games,…
Monte-Carlo simulations are routinely used for estimating the scaling exponents of complex systems. However, due to finite-size effects, determining the exponent values is often difficult and not reliable. Here we present a novel technique…
The Mersenne Twister MT19937 pseudorandom number generator, introduced by the last two authors in 1998, is still widely used. It passes all existing statistical tests, except for the linear complexity test, which measures the ratio of the…
So far, the pseudo cross-variogram is primarily used as a tool for the structural analysis of multivariate random fields. Mainly applying recent theoretical results on the pseudo cross-variogram, we use it as a cornerstone in the…