Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks - Supplement Yimeng Min Frederik Wenkel Guy Wolf A Proofs and Illustrative Examples of Lemmas 1 and 2

For any node v V, according to Eq. 8, we can write (Px)[v ] = This construction essentially generalizes the graph demonstrated in Figure 1 of the main paper (see Sec. 7). Therefore, computing these boils down to a simple proof by cases: 1. Let us now revisit the example given in the main paper (see Figure 1 or a copy in Figure 1). These responses with appropriate color coding give the illustration in Figure 1 in the main paper. As many applied fields such as Bioinformatics and Neuroscience heavily rely on the analysis of graph-structured data, the study of reliable classification methods has received much attention lately.