𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Convergence Rates in the Central Limit Theorems for Combinatorial Structures

✍ Scribed by H.-K. Hwang

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
210 KB
Volume
19
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

Flajolet and Soria established several central limit theorems for the parameter 'number of components' in a wide class of combinatorial structures. In this paper, we shall prove a simple theorem which applies to characterize the convergence rates in their central limit theorems. This theorem is also applicable to arithmetical functions. Moreover, asymptotic expressions are derived for moments of integral order. Many examples from different applications are discussed.

πŸ“œ SIMILAR VOLUMES

On the almost sure central limit theorem
On the almost sure central limit theorem for randomly indexed sums
✍ A. Krajka; J. Wasiura πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 169 KB πŸ‘ 1 views

## Abstract Let {__S~n~__, __n__ β‰₯ 1} be partial sums of independent identically distributed random variables. The almost sure version of CLT is generalized on the case of randomly indexed sums {__S~Nn~__, __n__ β‰₯ 1}, where {__N~n~__, __n__ β‰₯ 1} is a sequence of positive integer‐valued random varia

On the central limit theorem for the sta
On the central limit theorem for the stationary Poisson process of compact sets
✍ ZbynΔ›k Pawlas; Viktor BeneΕ‘ πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 214 KB πŸ‘ 1 views

## Abstract Stochastic geometry models based on a stationary Poisson point process of compact subsets of the Euclidean space are examined. Random measures on ℝ^__d__^, derived from these processes using Hausdorff and projection measures are studied. The central limit theorem is formulated in a way