The Expressive Power of Random-Feature MPNNs Across Graph Sizes

arXiv:2610.12809v1 Announce Type: new Abstract: Continuous random node features increase the expressivity of message-passing neural networks (MPNNs), but existing theoretical analyses are not fine-grained enough to capture their limitations, particularly in approximating functions across graph sizes or under a fixed number of random bits. We develop a population-level framework for size-uniform approximation. For MPNNs with a graph-size-independent Lipschitz bound in their initial features, including standard mean, max, and order-normalized sum architectures, we show that continuous random features can be quantized to finitely many colors with arbitrarily small uniform error in expected output. This reduction lets us transfer limitations on finite-color distinguishability to limitations on size-uniform approximation with continuous random features. We use this framework to prove that these MPNNs are not size-uniformly universal, analyze the expressivity gains from colors and independent trials, and establish incomparability between random-color MPNNs and higher-order Weisfeiler-Leman methods. We also give finite-color MPNN constructions for tree subgraph isomorphism via color coding and a local MST task.

Related

• Universality and Approximation Rates of Graph Neural Networks with Random Features
• Lost in Aggregation: On a Fundamental Expressivity Limit of Message-Passing Graph Neural Networks
• S^3GNN: Efficient Global Mixing and Local Message Passing for Long-Range Graph Learning
• Full-Spectrum Graph Neural Networks: Expressive and Scalable

Source: arXiv cs.LG | 2026-10-12