Related papers: Exponential approximation and Stein's method of ex…
An approximate Steiner tree is a Steiner tree on a given set of terminals in Euclidean space such that the angles at the Steiner points are within a specified error e from 120 degrees.This notion arises in numerical approximations of…
Kernel approximation with exponentials is useful in many problems with convolution quadrature and particle interactions such as integral-differential equations, molecular dynamics and machine learning. This paper proposes a weighted…
We propose a new scheme for the long time approximation of a diffusion when the drift vector field is not globally Lipschitz. Under this assumption, regular explicit Euler scheme --with constant or decreasing step-- may explode and implicit…
In this work, we consider a rational approximation of the exponential function to design an algorithm for computing matrix exponential in the Hermitian case. Using partial fraction decomposition, we obtain a parallelizable method, where the…
We develop a systematic derivation for the Limber approximation to the angular cross-power spectrum of two random fields, as a series expansion in 1/(\ell+1/2). This extended Limber approximation can be used to test the accuracy of the…
We use Stein's method to obtain a bound on the distance between scaled $p$-dimensional random walks and a $p$-dimensional (correlated) Brownian Motion. We consider dependence schemes including those in which the summands in scaled sums are…
As an application of Stein's method for Poisson approximation, we prove rates of convergence for the tail probabilities of two scan statistics that have been suggested for detecting local signals in sequences of independent random variables…
Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable…
Uniform cost-distance Steiner trees minimize the sum of the total length and weighted path lengths from a dedicated root to the other terminals. They are applied when the tree is intended for signal transmission, e.g. in chip design or…
This note shows how to apply the James-Stein estimator to the case of entropic uncertainty relations of more than two observables. A better result is found compared to applying the ordinary estimator and we find a more optimal model…
This paper is devoted to the adaptation of the method developed in [4,3] to a Fokker-Planck equation for fiber lay-down which has been studied in [1,5]. Exponential convergence towards a unique stationary state is proved in a norm which is…
Unitary best approximation to the exponential function on an interval on the imaginary axis has been introduced recently. In the present work two algorithms are considered to compute this best approximant: an algorithm based on rational…
We describe an algorithm that takes as input n points in the plane and a parameter {\epsilon}, and produces as output an embedded planar graph having the given points as a subset of its vertices in which the graph distances are a (1 +…
Combining Stein's method with heat kernel techniques, we study the function Tr(AO), where A is a fixed n by n real matrix over such that Tr(AA^t)=n, and O is from the Haar measure of the orthogonal group O(n,R). It is shown that the total…
We investigate error orders for integral limit approximations to traces of products of Toeplitz matrices generated by integrable functions on $[-\pi,\pi]$ having some singularities at the origin. Even though a sharp error order of the above…
This paper concerns the development of Stein's method for chi-square approximation and its application to problems in statistics. New bounds for the derivatives of the solution of the gamma Stein equation are obtained. These bounds involve…
We approximate the distribution of the sum of independent but not necessarily identically distributed Bernoulli random variables using a shifted binomial distribution where the three parameters (the number of trials, the probability of…
The closest point of a linear variety to an external point is found by using the equality case of an Ostrowski's type inequality. This point is given in closed form as the quotient of a (formal) and a (scalar) Gram determinant. Then, the…
Hamiltonian Truncation Effective Theory is a framework that aims to improve the results of Hamiltonian truncation in a systematic, order-by-order fashion using Effective Field Theory methodology. The result is a truncated effective…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…