pith. sign in

arxiv: 1404.1392 · v1 · pith:RHQ2ZCDWnew · submitted 2014-04-04 · 🧮 math.PR

A short survey of Stein's method

classification 🧮 math.PR
keywords methodsteinsomeapproacharticleperturbativesurveyvariant
0
0 comments X
read the original abstract

Stein's method is a powerful technique for proving central limit theorems in probability theory when more straightforward approaches cannot be implemented easily. This article begins with a survey of the historical development of Stein's method and some recent advances. This is followed by a description of a "general purpose" variant of Stein's method that may be called the generalized perturbative approach, and an application of this method to minimal spanning trees. The article concludes with the descriptions of some well known open problems that may possibly be solved by the perturbative approach or some other variant of Stein's method.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Cutoff for mixtures of permuted Markov chains: reversible case

    math.PR 2024-01 unverdicted novelty 7.0

    Proves cutoff at entropic time log n/h for reversible mixtures of permuted Markov chains under mild assumptions on the base chains.