This paper presents some preliminary observations relating in many cases structural definitions of combinatorial structures to statistical properties of their characteristic parameters.
The developments are based on two observations: (i) for a large family of classes of combinatorial structures, one can compile structural descriptions into functional equations over counting generating functions; (ii) general analytical patterns arise from the study of these functional equations.
As a consequence, statistical evaluations of a large number of parameters of combinatorial structures can be automated using symbolic manipulation systems.
The approach taken also suggests the existence of general theorems concerning statistical properties of combinatorial structures that may be used to analyse combinatorial structures of a complex form.