Aggregation of Evolutionary Game Dynamics on Large-Scale Weighted Networks
arXiv:2607.18776
2026
Architecture
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper provides an exact backward-equivalence aggregation for weighted networked evolutionary games: agents in the same class have identical future behavior when their weighted interactions with every equivalence class and their local update rules agree. The transferable asset is an equitable-partition and quotient construction that replaces an N-agent dynamical system by a K-class system while preserving trajectories on the class-synchronized invariant subspace. In neural networks, this can become an exact quotient message-passing architecture or a dynamic graph coarsening module, with a falsifiable zero-error condition when node features are class-constant and a measurable residual when the condition is only approximate.
Ideas from this paper
✓✓ Beats tuned baseline
2026
Partition graph nodes into backward-equivalent classes and run message passing on the K-node quotient graph instead of the original N-node graph. If every node in a class receives the same aggregate message from every source class and shares the same local update map, class-constant node representations remain class-constant at every layer, making the quotient computation exactly equivalent to the full GNN on that invariant subspace.
Useful8/10
Difficulty5/10
Novelty6/10