Related papers: Dimer lambda_3 = .453 +/- .001 and Some Other Very…

A recent asymptotic expansion for the positive zeros $x=j_{\nu,m}$ ($m=1,2,3,\ldots$) of the Bessel function of the first kind $J_{\nu}(x)$ is studied, where the order $\nu$ is positive. Unlike previous well-known expansions in the…

Statistical inference based on divergence measures have a long history. Recently, Maji, Ghosh and Basu (2014) have introduced a general family of divergences called the logarithmic super divergence (LSD) family. This family acts as a…

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. In particular, we argue that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ for $n \to…

We present a formal measure of argument strength, which combines the ideas that conclusions of strong arguments are (i) highly probable and (ii) their uncertainty is relatively precise. Likewise, arguments are weak when their conclusion…

We estimate the error term in the asymptotic formula of the Sidon constant for (ordinary) Dirichlet polynomials by providing explicit lower and upper bounds. The lower bound is already implicitly known, but we supply the necessary…

Laplace's method, a family of asymptotic methods used to approximate integrals, is presented as a potential candidate for the tool box of techniques used for knowledge acquisition and probabilistic inference in belief networks with…

We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of the network (or clique size) precludes exact computations.…

The use of standard statistical methods, such as maximum likelihood, is often justified based on their asymptotic properties. For suitably regular models, this theory is standard but, when the model is non-regular, e.g., the support depends…

In recent work the author presented a formal expansion for lambda_d associated to the dimer problem on a d-dimensional rectangular lattice. Expressed in terms of d it yielded a presumed asymptotic expansion for lambda_d in inverse powers of…

We evaluate priors by the second order asymptotic behavior of the corresponding estimators.Under certain regularity conditions, the risk differences between efficient estimators of parameters taking values in a domain D, an open connected…

We introduce a lazy approach to the explanation-based approximation of probabilistic logic programs. It uses only the most significant part of the program when searching for explanations. The result is a fast and anytime approximate…

We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…

Given $\epsilon \in (0,1)$, a probability measure $\mu$ on $\Omega\subset\mathbb{R}^p$ and a semi-algebraic set $K\subset X\times\Omega$, we consider the feasible set $X^*_\epsilon=\{x\in X:{\rm Prob}[(x,\omega)\in K]\geq 1-\epsilon\}$…

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

We propose a unified framework for likelihood-based regression modeling when the response variable has finite support. Our work is motivated by the fact that, in practice, observed data are discrete and bounded. The proposed methods assume…

A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…

We derive limiting distributions of symmetrized estimators of scatter, where instead of all $n(n-1)/2$ pairs of the $n$ observations we only consider $nd$ suitably chosen pairs, $1 \le d < \lfloor n/2\rfloor$. It turns out that the…

We present several results on counting untyped lambda terms, i.e., on telling how many terms belong to such or such class, according to the size of the terms and/or to the number of free variables.

We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…