Skip to main content

Mod-Gaussian convergence from a factorisation of the probability generating function

  • Chapter
  • First Online:
Mod-ϕ Convergence

Abstract

Let \((X_{n})_{n\in \mathbb{N}}\) be a sequence of bounded random variables with nonnegative integer values, and such that \(\sigma _{n}^{2}:=\mathop{ \mathrm{Var}}\nolimits (X_{n})\) tends to infinity. Denote \(P_{n}(t) = \mathbb{E}[t^{X_{n}}]\) the probability generating function of X n . Each P n (t) is a polynomial in t. Then, it is known that a sufficient condition for X n to be asymptotically Gaussian is that P n (t) has negative real roots (see references below). In this chapter, we prove that if the third cumulant L n 3: = κ (3)(X n ) also tends to infinity with light additional hypotheses, then a suitable renormalised version of X n converges in the mod-Gaussian sense. We then give an application for the number of blocks in a uniform set-partition of [n].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 19.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 29.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bibliography

  1. B. Chern, P. Diaconis, D. M. Kane, and R. C. Rhoades. Central Limit Theorems for some Set Partition Statistics. Advances in Applied Mathematics, 70:92–105, 2015.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Haigh. A neat way to prove asymptotic normality. Biometrika, 58(3):677–678, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  3. L. H. Harper. Stirling behavior is asymptotically normal. Ann. Math. Statist., 38(2):410–414, 1967.

    Article  MathSciNet  MATH  Google Scholar 

  4. H.-K. Hwang and J.-M. Steyaert. On the number of heaps and the cost of heap construction. In Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, pages 294–310, 2002.

    Google Scholar 

  5. J.L. Lebowitz, B. Pittel, D. Ruelle, and E.R. Speer. Central limit theorems, Lee-Yang zeros, and graph-counting polynomials. arXiv preprint 1408.4153, 2014.

    Google Scholar 

  6. A. Mohr. The Moser-Wyman expansion of the Bell numbers. Unpublished note, available on the web, 1995.

    Google Scholar 

  7. L. Moser and M. Wyman. An Asymptotic Formula for the Bell Numbers. Trans. Royal Soc. Canada, 49:49–54, 1955.

    MathSciNet  MATH  Google Scholar 

  8. A. J. Stam. Generation of a random partition of a finite set by an urn model. J. Comb. Th., Series A, 35(2):231–240, 1983.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 The Author(s)

About this chapter

Cite this chapter

Féray, V., Méliot, PL., Nikeghbali, A. (2016). Mod-Gaussian convergence from a factorisation of the probability generating function. In: Mod-ϕ Convergence. SpringerBriefs in Probability and Mathematical Statistics. Springer, Cham. https://doi.org/10.1007/978-3-319-46822-8_8

Download citation

Publish with us

Policies and ethics