Bayesian Predictive Synthesis for Dynamic Networks: Forecasting and Identifying Structural Mechanisms
Abstract
Networks are shaped by competing structural mechanisms, such as communities, geometry, or hubs. In a dynamic network the most predictive mechanism can change, and a model tied to one mechanism, or to fixed weights, cannot adapt as the dominant structure shifts. We develop dynamic Bayesian predictive synthesis for networks, in which a mechanism is an agent forecasting the next snapshot's edges and a synthesis layer combines them with time-varying weights. At each step the method returns a calibrated edge forecast and inference on the mechanism weights, with intervals valid given the fitted agents, so it also reports which mechanism is most informative. Inference of this kind requires a sparse-safe parametrization and an identification theory, under which a single graph identifies and estimates the weights. A sharp threshold separates distinguishable from indistinguishable mechanisms, a change in the active mechanism is tracked at an optimal per-switch cost, and for a single snapshot the method reduces to calibrated link prediction. On real networks, simulations, and benchmarks, the synthesis gives accurate, calibrated forecasts and recovers the leading mechanism when
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.