Related papers: Secure pseudorandom bit generators and point sets …
Using proper motion data for 894 stars in the Orion Nebula Cluster (ONC) compiled by Jones & Walker in 1988, we search for binaries with apparent separations in the range 1000-5000 AU, and find an upper limit of three. Using a Monte Carlo…
The generation of pseudo-random discrete probability distributions is of paramount importance for a wide range of stochastic simulations spanning from Monte Carlo methods to the random sampling of quantum states for investigations in…
Determining the number of change-points is a first-step and fundamental task in change-point detection problems, as it lays the groundwork for subsequent change-point position estimation. While the existing literature offers various methods…
Random numbers are commonly used in many different fields, ranging from simulations in fundamental science to security applications. In some critical cases, as Bell's tests and cryptography, the random numbers are required to be both secure…
We study the $L^{\infty}$ discrepancy of point sets generated by determinantal point processes on all compact, connected two-point homogeneous spaces, namely spheres and projective spaces. Using concentration inequalities and variance…
We consider a certain equidistributed sequence of rational numbers constructed from the primes. In particular, we determine the sharp convergence rate for the star discrepancy of said sequence. Our arguments are based on well-known…
The recently developed information-theoretic approach to crystallographic symmetry classifications and quantifications in two dimensions (2D) from digital transmission electron and scanning probe microscope images is adapted for the…
The ultimate random number generators are those certified to be unpredictable -- including to an adversary. The use of simple quantum processes promises to provide numbers that no physical observer could predict but, in practice, unwanted…
A disordered medium is often constructed by $N$ points independently and identically distributed in a $d$-dimensional hyperspace. Characteristics related to the statistics of this system is known as the random point problem. As $d \to…
Pseudorandom bit generators (PRBG) can be designed to take the advantage of some hard number theoretic problems such as the discrete logarithm problem (DLP). Such type of generators will have good randomness and unpredictability properties…
One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is…
We systematically extend the statement that the configurational entropy provides an alternative approach to studying gravitational stability of compact objects, carried out in the previous work of M. Gleiser and N. Jiang, Phys. Rev. D {\bf…
We have developed a low-cost off-the-shelf component star sensor (StarSense) for use in minisatellites and CubeSats to determine the attitude of a satellite in orbit. StarSense is an imaging camera with a limiting magnitude of 6.5, which…
Cryptography is always very important in data origin authentications, entity authentication, data integrity and confidentiality. In recent years, a variety of chaotic cryptographic schemes have been proposed. These schemes have typical…
We introduce a class of convex equivolume partitions. Expected star discrepancy results are compared for stratified samples under these partitions, including simple random samples. There are four main parts of our results. First, among…
Astronomers generally assume planet-forming disks are aligned with the rotation of their host star. However, recent observations have shown evidence of warping in protoplanetary disks. One can measure the statistical alignment between the…
Large-scale surveys will provide spectroscopy for $\sim$50 million resolved stars in the Milky Way and Local Group. However, these data will have a high degree of heterogeneity and most will be low-resolution ($R<10000$), posing challenges…
We study points in cut-and-project sets which are visible from the origin, continuing a direction of inquiry initiated in [6,14] where the asymptotic density of visible points was investigated. We establish an error bound for the density of…
This paper studies the problem of discrepancy estimates for pseudorandom vectors constructed by the elliptic curve congruential generator, particularly in the non-translational case. Two families of results are obtained. First, in a…
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…