Authors: Martin Grohe

We analyse the power of graph neural networks (GNNs) in terms of Boolean circuit complexity and descriptive complexity.
We prove that the graph queries that can be computed by a polynomial-size bounded-depth family of GNNs are exactly those definable in the guarded fragment GFO+C of first-order logic with counting and with built-in relations.
This puts GNNs in the circuit complexity class (non-uniform) $\text{TC}^0$.
Remarkably, the GNN families may use arbitrary real weights and a wide class of activation functions that includes the standard ReLU, logistic "sigmoid", and hyperbolic tangent functions. If the GNNs are allowed to use random initialisation and global readout (both standard features of GNNs widely used in practice), they can compute exactly the same queries as bounded depth Boolean circuits with threshold gates, that is, exactly the queries in $\text{TC}^0$.
Moreover, we show that queries computable by a single GNN with piecewise linear activations and rational weights are definable in GFO+C without built-in relations. Therefore, they are contained in uniform $\text{TC}^0$.

Comment: Journal version for TheoretiCS

• 03B70 - Logic in computer science
• 68Q06 - Networks and circuits as models of computation; circuit complexity
• 68Q07 - Biologically inspired models of computation (DNA computing, membrane computing, etc.)
• 68Q19 - Descriptive complexity and finite models