Proof of Theorem

To prove Theorem 1, we interpret graphon convolutions as generative models for graph convolutions. It is also possible to define graphon convolutions induced by graph convolutions. X,X null . 2 Therefore, it holds that λ Theorem 2 follows directly from Theorem 1 via the triangle inequality. Proof of Theorem 2. By the triangle inequality, we can bound null Y Error bars have been scaled by 1.5. The problem setup is as follows.