Randomness: what is it and why does it matter?

• URL: http://arxiv.org/abs/2303.08057v3
• Date: Fri, 27 Sep 2024 23:54:59 GMT
• Title: Randomness: what is it and why does it matter?
• Authors: Mario Stipčević,
• Abstract summary: A widely accepted definition of randomness lacks scientific rigor and its results are questionable. I propose an information-theory-based definition of randomness which focuses on the physical process of random number generation itself. A new quantity named "randomness deviation" allows for a practical measure of quality of a random number generating process or a device.
• Score: 0.0
• License:
• Abstract: Randomness is a crucial resource for a broad range of important applications, such as Monte Carlo simulation and computation, generative artificial intelligence and cryptography. But what is randomness? A widely accepted definition has eluded researchers thus far, yet without one any work that relies on notion of randomness lacks scientific rigor and its results are questionable. Here, I propose an information-theory-based definition of randomness which, unlike previous attempts, does not list desired properties of the generated number sequence, but rather focuses on the physical process of random number generation itself. This approach results in a definition which complies with our intuitive perception of randomness. It is demonstrated to be non-empty and verifiable. Moreover, a new quantity named "randomness deviation" allows for a practical measure of quality of a random number generating process or a device. An expression for it is derived for a Markovian process, which is frequently encountered in practice. Finally, a process-oriented definition of a random number sequence completes the toolbox needed for understanding, proving, and practical use of randomness.

Related papers

• Data Analysis Methods Preliminaries for a Photon-based Hardware Random Number Generator [39.58317527488534]
  Minecraft is great for games, but not so great for cybersecurity encryption key generation. PRNGs generate random numbers by quantifying some unpredictable phenomena into a number or string and feeding it into an algorithm. By using a hardware random number generator (HRNG), random numbers that are not susceptible to the flaws found in PRNGs can be attained at a high rate.
  arXiv  Detail & Related papers  (2024-04-15T00:47:17Z)
• Indistinguishability between quantum randomness and pseudo-randomness under efficiently calculable randomness measures [6.201566048090889]
  We present a no-go theorem for the distinguishability between quantum random numbers (i.e., random numbers generated quantum mechanically) and pseudo-random numbers (i.e., random numbers generated algorithmically) The theorem states that one cannot distinguish these two types of random numbers if the quantum random numbers are efficiently classically simulatable and the randomness measure used for the distinction is efficiently computable.
  arXiv  Detail & Related papers  (2023-09-20T07:50:30Z)
• Random Boxes Are Open-world Object Detectors [71.86454597677387]
  We show that classifiers trained with random region proposals achieve state-of-the-art Open-world Object Detection (OWOD) We propose RandBox, a Fast R-CNN based architecture trained on random proposals at each training. RandBox significantly outperforms the previous state-of-the-art in all metrics.
  arXiv  Detail & Related papers  (2023-07-17T05:08:32Z)
• Shortcomings of Top-Down Randomization-Based Sanity Checks for Evaluations of Deep Neural Network Explanations [67.40641255908443]
  We identify limitations of model-randomization-based sanity checks for the purpose of evaluating explanations. Top-down model randomization preserves scales of forward pass activations with high probability.
  arXiv  Detail & Related papers  (2022-11-22T18:52:38Z)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• Applications of Quantum Randomness: From Rabi Oscillations to Fourier Axis Controlling the Musical Timbre [0.0]
  We aim at achieving a new sense of aesthetic effect in music which derives from the true randomness that prevails in the natural quantum world. In this project, we attempt to take a further step by directly producing sound events from the genuine quantum true randomness of quantum physical systems.
  arXiv  Detail & Related papers  (2021-09-08T09:11:08Z)
• Generation of 1 Gb full entropy random numbers with the enhanced-NRBG method [0.13124513975412253]
  Experimental demonstration of a non-deterministic random bit generator from a quantum entropy source and a deterministic random bit generator mechanism. The extracted raw random numbers are further post-processed to generate a high-entropy seed for the hash based deterministic random bit generator.
  arXiv  Detail & Related papers  (2021-08-09T20:06:43Z)
• Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators [0.0]
  Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences. We present the results of a search for algorithmic randomness and incomputability in the output from two different QRNGs.
  arXiv  Detail & Related papers  (2021-01-04T21:17:34Z)
• Shannon Entropy Rate of Hidden Markov Processes [77.34726150561087]
  We show how to calculate entropy rates for hidden Markov chains. We also show how this method gives the minimal set of infinite predictive features. A sequel addresses the challenge's second part on structure.
  arXiv  Detail & Related papers  (2020-08-29T00:48:17Z)
• Stochastic Saddle-Point Optimization for Wasserstein Barycenters [69.68068088508505]
  We consider the populationimation barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. We employ the structure of the problem and obtain a convex-concave saddle-point reformulation of this problem. In the setting when the distribution of random probability measures is discrete, we propose an optimization algorithm and estimate its complexity.
  arXiv  Detail & Related papers  (2020-06-11T19:40:38Z)
• Using Randomness to decide among Locality, Realism and Ergodicity [91.3755431537592]
  An experiment is proposed to find out, or at least to get an indication about, which one is false. The results of such experiment would be important not only to the foundations of Quantum Mechanics.
  arXiv  Detail & Related papers  (2020-01-06T19:26:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.