Related papers: Secure pseudorandom bit generators and point sets …
A pseudo-random number generator (RNG) might be used to generate w-bit random samples in d dimensions if the number of state bits is at least dw. Some RNGs perform better than others and the concept of equidistribution has been introduced…
There has been much progress on efficient algorithms for clustering data points generated by a mixture of $k$ probability distributions under the assumption that the means of the distributions are well-separated, i.e., the distance between…
In this work we model stationary neutron star envelopes at high accretion rates and describe our new code for such studies. As a first step we put special emphasis on the rp-process which results in the synthesis of heavy elements and study…
We design a controlled-phase gate for linear optical quantum computing by using photodetectors that cannot resolve photon number. An intrinsic error-correction circuit corrects errors introduced by the detectors. Our controlled-phase gate…
We propose a new approach to nondeterministic random number generation. In theory, the randomness originated from the uncorrelated nature of consecutive laser pulses with Poissonian photon number distribution and that of the consecutive…
Consider an infinite sequence of independent, uniformly chosen points from $[0,1]^d$. After looking at each point in the sequence, an overseer is allowed to either keep it or reject it, and this choice may depend on the locations of all…
The pseudo-random number generators (PRNGs), sampling algorithms, and algorithms for generating random integers in some common statistical packages and programming languages are unnecessarily inaccurate, by an amount that may matter for…
Bayesian model comparison frameworks can be used when fitting models to data in order to infer the appropriate model complexity in a data-driven manner. We aim to use them to detect the correct number of major episodes of star formation…
Kilohertz quasi-periodic brightness oscillations (kHz QPOs) observed in certain X-ray burst sources may represent Keplerian frequencies in the inner regions of the accretion disk in such systems. If this assumption is strictly adhered to,…
We prove the existence of similar and multi-similar point configurations (or simplexes) in sets of fractional Hausdorff measure in Euclidean space. These results can be viewed as variants, for thin sets, of theorems for sets of positive…
In a seminal work, Nisan (Combinatorica'92) constructed a pseudorandom generator for length $n$ and width $w$ read-once branching programs with seed length $O(\log n\cdot \log(nw)+\log n\cdot\log(1/\varepsilon))$ and error $\varepsilon$. It…
The theory of digital sequences is a fundamental topic in QMC theory. Digital sequences are prototypes of sequences with low discrepancy. First examples were given by Il'ya Meerovich Sobol' and by Henri Faure with their famous…
Most quasi-Monte Carlo research focuses on sampling from the unit cube. Many problems, especially in computer graphics, are defined via quadrature over the unit triangle. Quasi-Monte Carlo methods for the triangle have been developed by…
We present an algorithm for producing discrete distributions with a prescribed nearest-neighbor distance function. Our approach is a combination of quasi-Monte Carlo (Q-MC) methods and weighted Riesz energy minimization: the initial…
Random number generation is an enabling technology for fields as varied as Monte Carlo simulations and quantum information science. An important application is a secure quantum key distribution (QKD) system; here, we propose and demonstrate…
$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…
We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…
Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts---a randomness source and its readout. The source is…
We describe a uniformly fast algorithm for generating points \vec{x} uniformly in a hypercube with the restriction that the difference between each pair of coordinates is bounded. We discuss the quality of the algorithm in the sense of its…
The problem of change-point estimation is considered under a general framework where the data are generated by unknown stationary ergodic process distributions. In this context, the consistent estimation of the number of change-points is…