Related papers: Multivariate normal approximation using exchangeab…
The authors give an approximation method for Bayesian inference in arena model, which is focused on paired comparisons with eliminations and bifurcations. The approximation method simplifies the inference by reducing parameters and…
This paper provides a general framework for Stein's density method for multivariate continuous distributions. The approach associates to any probability density function a canonical operator and Stein class, as well as an infinite…
Discrete Markov random fields form a natural class of models to represent images and spatial data sets. The use of such models is, however, hampered by a computationally intractable normalising constant. This makes parameter estimation and…
We provide a general steady-state diffusion approximation result which bounds the Wasserstein distance between the reversible measure $\mu$ of a diffusion process and the measure $\nu$ of an approximating Markov chain. Our result is…
In this paper, the maximum spacing method is considered for multivariate observations. Nearest neighbour balls are used as a multidimensional analogue to univariate spacings. A class of information-type measures is used to generalize the…
In this paper, we use Stein's method to obtain optimal bounds, both in Kolmogorov and in Wasserstein distance, in the normal approximation for the empirical distribution of the ground state of a many-interacting-worlds harmonic oscillator…
Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…
We study the Stein equation associated with the one-dimensional Gamma distribution, and provide novel bounds, allowing one to effectively deal with test functions supported by the whole real line. We apply our estimates to derive new…
Motivated by open problems in applied and computational algebraic topology, we establish multivariate normal approximation theorems for three random vectors which arise organically in the study of random clique complexes. These are: (1) the…
Approximate inference in probability models is a fundamental task in machine learning. Approximate inference provides powerful tools to Bayesian reasoning, decision making, and Bayesian deep learning. The main goal is to estimate the…
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…
The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…
New bounds for the $k$-th order derivatives of the solutions of the normal and multivariate normal Stein equations are obtained. Our general order bounds involve fewer derivatives of the test function than those in the existing literature.…
Estimation of covariance matrices or their inverses plays a central role in many statistical methods. For these methods to work reliably, estimated matrices must not only be invertible but also well-conditioned. In this paper we present an…
One of the key ingredients to successfully apply Stein's method for distributional approximation are solutions to the Stein equations and their derivatives. Using Barbour's generator approach, one can solve for the solutions to the Stein…
Let $S_{n}$ be a sum of independent identically distribution random variables with finite first moment and $h_{M}$ be a call function defined by $g_{M}(x)=\max\{x-M,0\}$ for $x\in\mathbb{R}$, $M>0$. In this paper, we assume the random…
Stein's method compares probability distributions through the study of a class of linear operators called Stein operators. While mainly studied in probability and used to underpin theoretical statistics, Stein's method has led to…
We establish a general framework to study the rate of convergence of a Euler type approximation scheme with decreasing time steps to the invariant measure, for a general class of stochastic systems. The error is measured in general…
We introduce a version of Stein's method of comparison of operators specifically tailored to the problem of bounding the Wasserstein-1 distance between continuous and discrete distributions on the real line. Our approach rests on a new…
A stochastic ordering approach is applied with Stein's method for approximation by the equilibrium distribution of a birth-death process. The usual stochastic order and the more general s-convex orders are discussed. Attention is focused on…