Beyond node strengths: the topological content of weighted bipartite networks

arXiv:2611.10085v1 Announce Type: new Abstract: Weighted bipartite networks encode the topology and intensity of interactions between two disjoint sets of nodes. However, it is unclear whether the observed pattern of connections is already explained by node interaction volumes or contains additional structural information. Here we introduce a hierarchy of maximum-entropy models for continuous weighted bipartite networks that preserves node strengths alone, strengths and global density, or strengths and the complete degree sequence. Across economic, technological, ecological, social and lexical systems, we find that strength constraints alone are generally insufficient to reproduce empirical structures. Yet the missing topological information is often low-dimensional: a single constraint controlling network density frequently provides the most parsimonious description, whereas networks with stronger residual degree heterogeneity require node-specific constraints. Beyond downstream inference, we also show how the choice of topological resolution changes which interactions and projected relationships are identified as statistically significant. Our results indicate that topology is essential, but often compressible, in the statistical modeling of weighted bipartite networks, and provide a scalable computational framework for fitting, sampling, model selection and validation within a common workflow.