English
Related papers

Related papers: When does randomness come from randomness?

200 papers

The paper considers quantitative versions of different randomness notions: algorithmic test measures the amount of non-randomness (and is infinite for non-random sequences). We start with computable measures on Cantor space (and Martin-Lof…

Logic · Mathematics 2011-05-27 Laurent Bienvenu , Peter Gacs , Mathieu Hoyrup , Cristobal Rojas , Alexander Shen

Emergence of deterministic and irreversible macroscopic behavior from deterministic and reversible microscopic dynamics is understood as a result of the law of large numbers. In this paper, we prove on the basis of the theory of algorithmic…

Statistical Mechanics · Physics 2019-11-19 Ken Hiura , Shin-ichi Sasa

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…

Logic in Computer Science · Computer Science 2015-07-01 Sam Buss , Douglas Cenzer , Jeffrey B. Remmel

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

Combinatorics · Mathematics 2025-02-21 Yaobin Chen , Xizhi Liu , Jiaxi Nie , Ji Zeng

Randomness is a central concept to statistics and physics. Here, a statistical analysis shows experimental evidence that tossing coins and finding last digits of prime numbers are identical regarding statistics for equally likely outcomes.…

Applications · Statistics 2019-10-29 Yeseul Kim , Byung Mook Weon

We study Doob's martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given.…

Logic in Computer Science · Computer Science 2015-07-01 Bjørn Kjos-Hanssen , Paul Kim Long V. Nguyen , Jason Rute

Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-\pi, \pi]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f…

Logic · Mathematics 2016-03-16 Johanna Franklin , Timothy McNicholl , Jason Rute

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the…

Combinatorics · Mathematics 2010-06-29 Noga Alon , Simi Haber , Michael Krivelevich

Martin's Conjecture is a proposed classification of the definable functions on the Turing degrees. It is usually divided into two parts, the first of which classifies functions which are not above the identity and the second of which…

Logic · Mathematics 2024-04-08 Patrick Lutz , Benjamin Siskind

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

Number Theory · Mathematics 2025-11-19 Oleksiy Klurman , Vlad Matei

A state $\rho=(\rho_n)_{n=1}^{\infty}$ is a sequence such that $\rho_n$ is a density matrix on $n$ qubits. It formalizes the notion of an infinite sequence of qubits. The von Neumann entropy $H(d)$ of a density matrix $d$ is the Shannon…

Quantum Physics · Physics 2025-04-15 Tejas Bhojraj

We consider the individual points on a Martin-L\"of random path of Brownian motion. We show (1) that Khintchine's law of the iterated logarithm holds at almost all points; and (2) there exist points (besides the trivial example of the…

Logic · Mathematics 2014-08-14 Bjørn Kjos-Hanssen , Anil Nerode

We consider the problem of random sampling for band-limited functions. When can a band-limited function $f$ be recovered from randomly chosen samples $f(x_j), j\in \mathbb{N}$? We estimate the probability that a sampling inequality of the…

Probability · Mathematics 2011-04-27 Karlheinz Gröchenig , Richard F. Bass

We show that if a real $x$ is strongly Hausdorff $h$-random, where $h$ is a dimension function corresponding to a convex order, then it is also random for a continuous probability measure $\mu$ such that the $\mu$-measure of the basic open…

Logic · Mathematics 2008-04-17 Jan Reimann

We study Martin-L\"{o}f random (ML-random) points on computable probability measures on sample and parameter spaces (Bayes models). We consider variants of conditional randomness defined by ML-randomness on Bayes models and those of…

Information Theory · Computer Science 2023-04-24 Hayato Takahashi

We introduce a family of two-dimensional reflected random walks in the positive quadrant and study their Martin boundary. While the minimal boundary is systematically equal to a union of two points, the full Martin boundary exhibits an…

Probability · Mathematics 2022-09-27 Irina Ignatiouk-Robert , Irina Kourkova , Kilian Raschel

Mass-stationarity means that the origin is at a typical location in the mass of a random measure. It is an intrinsic characterisation of Palm versions with respect to stationary random measures. Stationarity is the special case when the…

Probability · Mathematics 2015-07-20 Guenter Last , Hermann Thorisson

This short note gives a sufficient condition for having the class of polynomials dense in the space of square integrable functions with respect to a finite measure dominated by the Lebesgue measure in the real line, here denoted by $L^2$.…

Classical Analysis and ODEs · Mathematics 2016-03-14 Rodrigo Labouriau

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

Discrete Mathematics · Computer Science 2008-09-18 Bidu Prakash Das , Soubhik Chakraborty

The unpredictability of quantum physics gives rise to intrinsic randomness. In an adversarial scenario, any additional degrees of freedom must be attributed to an eavesdropper with correlations to the measurement set-up. The true randomness…

Quantum Physics · Physics 2026-05-19 Fionnuala Curran
‹ Prev 1 3 4 5 6 7 10 Next ›