Critical scaling profile for trees and connected subgraphs on the complete graph

Abstract

We analyse generating functions for trees and for connected subgraphs on the complete graph, and identify a single scaling profile which applies for both generating functions in a critical window. Our motivation comes from the analysis of the finite-size scaling of lattice trees and lattice animals on a high-dimensional discrete torus, for which we conjecture that the identical profile applies in dimensions $d \ge 8$.