Answers are grounded in this paper and cite their sources.
A cluster expansion, valid at low densities, is derived for the mean number of clusters in a random mixture of sites or bonds on a graph. It is shown that only clusters without a cut-point (stars) are required, and a number of general theorems for determining the weights are proved.
No takes yet. Share an insight, caveat, or question.
Essam et al. (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: