## Block Statistics in Subcritical Graph Classes

subcritical graph class
block statistic
number of blocks
number of edges
number of spanning trees

- Mathematics of computing → Random graphs
- Mathematics of computing → Generating functions

**Abstract.**
We study block statistics in subcritical graph classes; these are statistics that can be defined as the sum of a certain weight function over all blocks. Examples include the number of edges, the number of blocks, and the logarithm of the number of spanning trees. The main result of this paper is a central limit theorem for statistics of this kind under fairly mild technical assumptions.