Related papers: On the optimality of Stein factors
We apply the Stein-Chen method to problems from extreme value theory. On the one hand, the Stein-Chen method for Poisson approximation allows us to obtain bounds on the Kolmogorov distance between the law of the maximum of i.i.d. random…
We introduce a simple iterative technique for bounding derivatives of solutions of Stein equations $Lf=h-\mathbb{E}h(Z)$, where $L$ is a linear differential operator and $Z$ is the limit random variable. Given bounds on just the solutions…
This paper is concerned with the Stein's method associated with a (possibly) asymmetric $\alpha$-stable distribution $Z$, in dimension one. More precisely, its goal is twofold. In the first part, we exhibit a genuine bound for the…
We extend Stein's method to include dependence with respect to an auxiliary random variable, for conditional laws for which Stein's characterizations do exist.
Wigner's famous and influential claim that mathematics is "unreasonably effective" in physics is founded on unreasonable assumptions about the nature of mathematics and its independence of physics. Here I argue that what is surprising is…
In this paper, we obtain error bound for binomial and negative binomial approximations to weighted sums of locally dependent random variables, using Stein's method. We also discuss approximation results for weighted sums of independent…
Stein's method for measuring convergence to a continuous target distribution relies on an operator characterizing the target and Stein factor bounds on the solutions of an associated differential equation. While such operators and bounds…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
We build upon recent advances on the distributional aspect of Stein's method to propose a novel and flexible technique for computing Stein operators for random variables that can be written as products of independent random variables. We…
This work explores and develops elements of Stein's method of approximation, in the infinitely divisible setting, and its connections to functional analysis. It is mainly concerned with multivariate self-decomposable laws without finite…
Two approximations are frequently used in statistical physics: the first one, which we shall name the mean values approximation, is generally (and improperly) named as "maximum term approximation". The second is the "Stirling…
Stein's method of exchangeable pairs is examined through five examples in relation to Poisson and normal distribution approximation. In particular, in the case where the exchangeable pair is constructed from a reversible Markov chain, we…
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…
In this article we propose a general framework for normal approximation using Stein's method. We introduce the new concept of Stein couplings and we show that it lies at the heart of popular approaches such as the local approach,…
The first essential ingredient to build up Stein's method for a continuous target distribution is to identify a so-called \textit{Stein operator}, namely a linear differential operator with polynomial coefficients. In this paper, we…
We generalize the so-called density approach to Stein characterizations of probability distributions. We prove an elementary factorization property of the resulting Stein operator in terms of a generalized (standardized) score function. We…
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.
The Steiner Forest problem, also known as the Generalized Steiner Tree problem, is a fundamental optimization problem on edge-weighted graphs where, given a set of vertex pairs, the goal is to select a minimum-cost subgraph such that each…
When looking for a solution, deterministic methods have the enormous advantage that they do find global optima. Unfortunately, they are very CPU-intensive, and are useless on untractable NP-hard problems that would require thousands of…
Sturmian words are infinite binary words with many equivalent definitions: They have a minimal factor complexity among all aperiodic sequences; they are balanced sequences (the labels 0 and 1 are as evenly distributed as possible) and they…