Related papers: Asymptotic Vanishing of the Success Probability in…
Asymptotic optimality is a key theoretical property in model averaging. Due to technical difficulties, existing studies rely on restricted weight sets or the assumption that there is no true model with fixed dimensions in the candidate set.…
In this paper, using the shrinkage-based approach for portfolio weights and modern results from random matrix theory we construct an effective procedure for testing the efficiency of the expected utility (EU) portfolio and discuss the…
In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…
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)$…
The hole probability, i.e., the probability that a region is void of particles, is a benchmark of correlations in many body systems. We compute analytically this probability $P(R)$ for a spherical region of radius $R$ in the case of $N$…
The goal of this paper is to outline a general-purpose scalable implementation of Shor's period finding algorithm using fundamental quantum gates, and to act as a blueprint for linear optical implementations of Shor's algorithm for both…
Simple Monte Carlo is a versatile computational method with a convergence rate of $O(n^{-1/2})$. It can be used to estimate the means of random variables whose distributions are unknown. Bernoulli random variables, $Y$, are widely used to…
A method of calculating probability values from a system of marginal constraints is presented. Previous systems for finding the probability of a single attribute have either made an independence assumption concerning the evidence or have…
Let $G$ be the interior domain of a piecewise analytic Jordan curve without cusps. Let $\{p_n\}_{n=0}^\infty$ be the sequence of polynomials that are orthonormal over $G$ with respect to the area measure, with each $p_n$ having leading…
We propose confidence regions with asymptotically correct uniform coverage probability of parameters whose Fisher information matrix can be singular at important points of the parameter set. Our work is motivated by the need for reliable…
The recent paper [F. Arute et al. Nature {\bf 574}, 505 (2019)] considered exact classical sampling of the output probability distribution of the globally depolarized random quantum circuit. In this paper, we show three results. First, we…
In this paper, we consider the problem of noiseless non-adaptive group testing under the for-each recovery guarantee, also known as probabilistic group testing. In the case of $n$ items and $k$ defectives, we provide an algorithm attaining…
Hardness of approximation (HA) -- the phenomenon that, assuming P $\neq$ NP, one can easily compute an $\epsilon$-approximation to the solution of a discrete computational problem for $\epsilon > \epsilon_0 > 0$, but for $\epsilon <…
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…
We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…
In this paper we consider the distribution of the zeros of a real random Bargmann-Fock function of one or more variables. For these random functions we prove estimates for two types of families of events, both of which are large deviations…
We describe a group theoretic analysis of Shor's algorithm and other related hidden subgroup problems in mathematics and relate these to symmetries of molecular and condensed phase assemblies. By recasting Shor's algorithm through the lens…
A remarkable feature of Schur functions -- the common eigenfunctions of cut-and-join operators from $W_\infty$ -- is that they factorize at the peculiar two-parametric topological locus in the space of time-variables, what is known as the…
For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length…
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…