Non-symmetric vector dyson equations
arXiv:2607.16333
2026
Architecture
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper provides a nonlinear diagonal scaling for arbitrary nonnegative, non-symmetric interaction matrices, obtained from the vector Dyson equation. In the purely imaginary specialization, the complex equation becomes a positive fixed-point system whose solution transforms a directed matrix into a strictly substochastic diagonally scaled matrix, without requiring symmetry or reversible graph structure. This suggests a graph-neural-network propagation normalization that controls amplification on directed graphs more robustly than degree normalization, with the damping parameter providing an explicit stability knob.
Ideas from this paper
Unverified
2026
Replace ordinary row-degree or symmetric normalization in a directed graph neural network with a nonlinear Dyson scaling. For a nonnegative directed adjacency matrix A, solve a positive vector equation and propagate with B = D A D, where D is the diagonal matrix of the solution. The resulting operator has row sums strictly below one, giving an explicit bound against exploding directed message propagation while retaining asymmetric edge information.
Useful6/10
Difficulty5/10
Novelty7/10