相关论文: New coins from old, smoothly

Consider the KPP-type equation of the form $\Delta u+f(u)=0$, where $f:[0,1] \to \mathbb R_{+}$ is a concave function. We prove for arbitrary dimensions that there is no solution bounded in $(0,1)$. The significance of this result from the…

In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version, each participant test whether or not the other has attempted to create a bias on this bit. It is requested that,…

We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…

Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if…

Let $\mathcal{P}$ be the set of the primes. We consider a class of random multiplicative functions $f$ supported on the squarefree integers, such that $\{f(p)\}_{p\in\mathcal{P}}$ form a sequence of $\pm1$ valued independent random…

Let $\alpha \colon \mathbb{N} \to S^1$ be the Steinhaus multiplicative function: a completely multiplicative function such that $(\alpha(p))_{p\text{ prime}}$ are i.i.d.~random variables uniformly distributed on the complex unit circle…

We construct a smooth real-valued function P(n) in [0,1], defined via a triple integral with a periodic kernel, that approximates the characteristic function of prime numbers. The function is built to suppress when n is divisible by some m…

Shelah Spencer [ShSp:304] proved the 0-1 law for the random graphs G(n,p_n), p_n=n^{- alpha}, alpha in (0,1) irrational (set of nodes in [n]= {1, ...,n}, the edges are drawn independently, probability of edge is p_n). One may wonder what…

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

This paper develops a comprehensive probabilistic setup to compute approximating functions in active subspaces. Constantine et al. proposed the active subspace method in (Constantine et al., 2014) to reduce the dimension of computational…

It is well known that if a function $f$ satisfies $$\|f(x) e^{\pi \alpha |x|^2}\|_p + \| \widehat{f}(\xi) e^{\pi \alpha |\xi|^2} \|_q<\infty \qquad\qquad\qquad(*)$$ with $\alpha=1$ and $1\le p,q<\infty$, then $f\equiv 0.$ We prove that if…

We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…

For an $n\times n$ random image with independent pixels, black with probability $p(n)$ and white with probability $1-p(n)$, the probability of satisfying any given first-order sentence tends to 0 or 1, provided both $p(n)n^{\frac{2}{k}}$…

Forty years ago, Wiesner pointed out that quantum mechanics raises the striking possibility of money that cannot be counterfeited according to the laws of physics. We propose the first quantum money scheme that is (1) public-key, meaning…

Here several perfect simulation algorithms are brought under a single framework, and shown to derive from the same probabilistic result, called here the Fundamental Theorem of Perfect Simulation (FTPS). An exact simulation algorithm has…

The well-know needle experiment of Buffon can be regarded as an analog (i.e., continuous) device that stochastically "computes" the number 2/pi ~ 0.63661, which is the experiment's probability of success. Generalizing the experiment and…

Many people have flipped coins but few have stopped to ponder the statistical and physical intricacies of the process. We collected $350{,}757$ coin flips to test the counterintuitive prediction from a physics model of human coin tossing…

Consider a randomized algorithm that draws samples exactly from a distribution using recursion. Such an algorithm is called a perfect simulation, and here a variety of methods for building this type of algorithm are shown to derive from the…

Suppose that $X_1,X_2,\ldots$ are independent identically distributed Bernoulli random variables with mean $p$. A Bernoulli factory for a function $f$ takes as input $X_1,X_2,\ldots$ and outputs a random variable that is Bernoulli with mean…

For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibonacci numbers, where the order of the summands does not matter. Moreover, for all positive integers $p$ and $N$, let \begin{equation*}…