Related papers: New coins from old, smoothly

Let P be a Poisson process of intensity one in a square S_n of area n. For a fixed integer k, join every point of P to its k nearest neighbours, creating an undirected random geometric graph G_{n,k}. We prove that there exists a critical…

We consider a conception of reality that is the following: An object is 'real' if we know that if we would try to test whether this object is present, this test would give us the answer 'yes' with certainty. If we consider a conception of…

The main result is the following Theorem: Let p=p(n) be such that p(n) in [0,1] for all n and either p(n)<< n^{-1} or for some positive integer k, n^{-1/k}<< p(n)<< n^{-1/(k+1)} or for all epsilon >0, n^{- epsilon}<< p(n) and n^{-…

Let $D$ be an open disk of radius $\le 1$ in $\mathbb C$, and let $(\epsilon_n)$ be a sequence of $\pm 1$. We prove that for every analytic function $f: D \to \mathbb C$ without zeros in $D$, there exists a unique sequence $(\alpha_n)$ of…

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

Let $f: {\mathbb R}\to {\mathbb R}$ be a measurable function satisfying \begin{equation*} f(x+1)=f(x), \qquad \int_0^1 f(x)\, dx=0, \qquad \int_0^1 f^2(x)\, dx<\infty. \end{equation*} The asymptotic properties of series $\sum c_k f(kx)$…

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.…

Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})<p^{\alpha}$ and $f(p)\vert f(p^{\alpha})$. Suppose also that any prime that…

Let $\mathcal{P}$ be the set of all primes and $\pi(x)$ be the number of primes up to $x$. For any $n\ge 2$, let $P^+(n)$ be the largest prime factor of $n$. For $0<c<1$, let $$T_c(x)=\#\{p\le x:p\in \mathcal{P},P^+(p-1)\ge p^c\}.$$ In this…

It is well known that there is no direct one-to-one relation between $p$-values and likelihood ratios or Bayes factors, since their relation crucially involves the sample size $n$. We investigate their (asymptotic) relation in a…

We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability distributions given in the form of an oracle $f:[n]\to[m]$.…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

Let $f_n(z) = \sum_{k = 0}^n \varepsilon_k z^k$ be a random polynomial where $\varepsilon_0,\ldots,\varepsilon_n$ are i.i.d. random variables with $\mathbb{E} \varepsilon_1 = 0$ and $\mathbb{E} \varepsilon_1^2 = 1$. Letting $r_1,…

This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…

Let $S_{n,k}$ denote the random geometric graph obtained by placing points in a square box of area $n$ according to a Poisson process of intensity 1 and joining each point to its $k$ nearest neighbours. Balister, Bollob\'as, Sarkar and…

Within a Bayesian retrospective framework, we present a way of examining the distribution of \cps through a novel set estimator. For a given level, $\alpha$, we aim at smallest sets that cover all \cps with a probability of at least…

We consider the problem of estimating a probability of failure $\alpha$, defined as the volume of the excursion set of a function $f:\mathbb{X} \subseteq \mathbb{R}^{d} \to \mathbb{R}$ above a given threshold, under a given probability…

Faced with a sequence of N binary events, such as coin flips (or Ising spins), it is natural to ask whether these events reflect some underlying dynamic signals or are just random. Plausible models for the dynamics of hidden biases lead to…

The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…

Let $f$ be a real function defined on the interval $[0,1]$ which is constant on $(a,b)\subset [0,1]$, and let $B_nf$ be its associated $n$th Bernstein polynomial. We prove that, for any $x\in (a,b)$, $|B_nf(x)-f(x)|$ converges to $0$ as…