 Solution

For $k=1,\dots ,C$, define the class degree sumand define the number of within-college friendships byEach between-college edge contributes once to the degree sum of each endpoint's college, while each within-college edge contributes twice to its college's degree sum. The model-3 likelihood can therefore be writtenThe Fisher-Neyman factorization theorem shows that $T=(T_0,T_1,\dots ,T_C)$ is sufficient.

For two networks $y,y^{\prime }$, the likelihood ratio isBecause the parameters range independently over ${\mathbb{R}}^{C+1}$, this ratio is constant in $\beta$ exactly when every displayed difference vanishes. The likelihood-ratio criterion for minimal sufficiency therefore gives the answerThis is the degree-sum sufficient statistic for an additive logistic network model.