Central limit theorems and the geometry of polynomials
Abstract
Let X ∈ \0,…,n \ be a random variable, with mean μ and standard deviation σ and let \[fX(z) = Σk P(X = k) zk, \] be its probability generating function. Pemantle conjectured that if σ is large and fX has no roots close to 1∈ C then X must be approximately normal. We completely resolve this conjecture in the following strong quantitative form, obtaining sharp bounds. If δ = ζ|ζ-1| over the complex roots ζ of fX, and X := (X-μ)/σ, then \[ t ∈ R |P(X ≤ t) - P( Z ≤ t) \, | = O( nδσ ) \] where Z N(0,1) is a standard normal. This gives the best possible version of a result of Lebowitz, Pittel, Ruelle and Speer. We also show that if fX has no roots with small argument, then X must be approximately normal, again in a sharp quantitative form: if we set δ = ζ|(ζ)| then \[ t ∈ R |P(X ≤ t) - P( Z ≤ t) \, | = O(1δσ ). \] Using this result, we answer a question of Ghosh, Liggett and Pemantle by proving a sharp multivariate central limit theorem for random variables with real-stable probability generating functions.