Paperlane

no. 16 · Tuesday 17 November 2026

Network recovery from aggregated relational data: alignment and resolution

Yen-hsuan Tseng

math.ST · v2 · 13 pp

Abstract

We prove that labeled edge probabilities can be recovered uniformly from complete aggregated relational data (ARD) at a given community composition if and only if the sum of trait alignment and partition resolution diverges. We study a two-community logistic network with fixed known weak signal and $K$ trait groups of size $m$. If $b_k$ is the difference between the two community counts in group $k$, alignment $Λ=\|b\|_2^2/m$ measures separation in the mean counts. Resolution $ρ=K/m^2$ measures the information that accumulates across groups through joint count fluctuations. Without knowing $b$, the full count likelihood gives a mean squared error bounded by $Ce^{-c(Λ+ρ)}+O((Km)^{-2})$ under bounded-energy activity perturbations. At exact group balance and zero activity, the minimax risk is $\exp\{-Θ(ρ)\}$ as $ρ\to\infty$. Uniform recovery over all globally balanced community assignments holds exactly when $ρ\to\infty$. At zero activity, when the community assignment is uniform over all balanced assignments, the optimal mean squared error averaged over assignments and networks vanishes exactly when $K\to\infty$. The population count law identifies every edge probability, and full adjacency permits uniform recovery throughout the model.

comments
13 pages; 38-page supplement in anc/supplement.pdf. Retitled and substantially expanded. The two-group impossibility result for labeled edge probabilities is the $K=2$ case of Corollary 2.4. New: a necessary and sufficient criterion for uniform recovery at a given group composition, exponential risk bounds, and a recovery criterion for uniformly random balanced labels. Submitted to Bernoulli
fields
Statistics Theory
pdf ↗ page arXiv:2609.07077 ↗