Local Limit Theorems for Sums of Power Series Distributed Random Variables and for the Number of Components in Labelled Relational Structures

A Local limit theorem for the distribution of the number of components in random labelled relational structures of size n (e.g., a type of random graphs on n vertices, random permutations of n elements, etc.) is proved as n→∞. The case when the corresponding exponential generating functions diverge at their radii of convergence is considered.