2014/04/04 by Sourav Chatterjee, Chatterjee, Sourav · 7 citations
Mathematics · #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #FOS: Mathematics #Primary 60F05 #Probability (math.PR) #Random Matrices and Applications #Secondary 60B10
paper · pdf · doi:10.48550/arxiv.1404.1392
openalex publication_date 2014/04/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.