Original: S IMPLE S PECTRAL G RAPH C ONVOLUTION
Revised: S IMPLE S PECTRAL G RAPH C ONVOLUTION

Original: Anonymous authors
Revised: Anonymous authors

Original: Paper under double-blind review
Revised: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: Graph Convolutional Networks (GCNs) have drawn signiﬁcant attention and become leading methods for learning graph representations.
Revised: Graph Convolutional Networks (GCNs) have drawn signiﬁcant attention and become leading methods for learning graph representations.

Original: The most GCNs suffer the performance loss when the depth of the model increases.
Revised: The most GCNs suffer the performance loss when the depth of the model increases.

Original: Similarly to CNNs, without specially designed architectures, the performance of a network degrades quickly with increased depth.
Revised: Similarly to CNNs, without specially designed architectures, the performance of a network degrades quickly with increased depth.

Original: Some researchers argue that the required neighbourhood size and neural network depth are two completely orthogonal aspects of graph representation.
Revised: Some researchers argue that the required neighbourhood size and neural network depth are two completely orthogonal aspects of graph representation.

Original: Thus, several methods extend the neighbourhood by aggregating k -hop neighbourhoods of nodes while using shallow neural networks.
Revised: Thus, several methods extend the neighbourhood by aggregating k -hop neighbourhoods of nodes while using shallow neural networks.

Original: However, these methods still encounter oversmoothing, high computation and storage costs.
Revised: However, these methods still encounter oversmoothing, high computation and storage costs.

Original: In this paper, we use the Markov Diffusion Kernel to derive a variant of GCN called Simple Spectral Graph Convolution (S 2 GC) which is closely related to spectral models and combines strengths of both spatial and spectral methods.
Revised: In this paper, we use a modiﬁed Markov Diffusion Kernel to derive a variant of GCN called Simple Spectral Graph Convolution (S 2 GC).

Original: Our spectral analysis shows that our simple spectral graph convolution used in S 2 GC is a trade-off of low-pass and high-pass ﬁlter which captures the global and local contexts of each node.
Revised: Our spectral analysis shows that our simple spectral graph convolution used in S 2 GC is a trade-off of low-pass and high-pass ﬁlter which captures the global and local contexts of each node.

Revised: We provide two theoretical claims which demonstrate that we can aggregate over a sequence of increasingly larger neighborhoods compared to competitors while limiting severe oversmoothing.

Original: Our experimental evaluation demonstrates that S 2 GC with a linear learner is competitive in text, node and graph classiﬁcation tasks.
Revised: Our experimental evaluation demonstrates that S 2 GC with a linear learner is competitive in text, node and graph classiﬁcation tasks.

Original: Moreover, S 2 GC is comparable to other state-of-the-art methods for node clustering and community prediction tasks.
Revised: Moreover, S 2 GC is comparable to other state-of-the-art methods for node clustering and community prediction tasks.

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: In the past few years, the rise and application of deep learning have successfully promoted the research of computer vision and data mining.
Revised: In the past few years, the rise and application of deep learning have successfully promoted the research of computer vision and data mining.

Original: Although these deep learning methods have been applied to extract the features on the Euclidean lattice (spatial data) with great success, the data in many practical scenarios lies on non-Euclidean structures.
Revised: Although these deep learning methods have been applied to extract the features on the Euclidean lattice (spatial data) with great success, the data in many practical scenarios lies on non-Euclidean structures.

Original: Processing non-Euclidean structures is a challenge for deep learning methods.
Revised: Processing non-Euclidean structures is a challenge for deep learning methods.

Original: By deﬁning a convolution operator between the graph and signal, Graph Convolutional Networks (GCNs) generalize Convolutional Neural Networks (CNNs) to graph-structured inputs which contain attributes.
Revised: By deﬁning a convolution operator between the graph and signal, Graph Convolutional Networks (GCNs) generalize Convolutional Neural Networks (CNNs) to graph-structured inputs which contain attributes.

Original: Message Passing Neural Networks (MPNNs)
Revised: Message Passing Neural Networks (MPNNs)

Original: (Gilmer et al., 2017) unify the graph convolution as two functions: the transformation function and the aggregation function.
Revised: (Gilmer et al., 2017) unify the graph convolution as two functions: the transformation function and the aggregation function.

Original: MPNN iteratively propagates node features based on the adjacency structure of graph in a number of rounds.
Revised: MPNN iteratively propagates node features based on the adjacency structure of graph in a number of rounds.

Original: Despite their enormous success in many applications like social media, trafﬁc analysis, biology, recommendation systems and even computer vision, most of the current GCN models use shallow architectures because many of the recent models such as GCN (Kipf & Welling, 2016) achieve their best performance with 2-layer models.
Revised: Despite their enormous success in many applications like social media, trafﬁc analysis, biology, recommendation systems and even computer vision, most of the current GCN models use shallow architectures because many of the recent models such as GCN (Kipf & Welling, 2016) achieve their best performance with 2-layer models.

Original: In other words, 2-layer GCN models aggregate nodes in twohops neighbourhood and thus have no ability to extract information in k -hops neighbourhoods for k > 2 .
Revised: In other words, 2-layer GCN models aggregate nodes in twohops neighbourhood and thus have no ability to extract information in k -hops neighbourhoods for k > 2 .

Original: Moreover, stacking more layers and adding a non-linearity tends to degrade the performance of these models.
Revised: Moreover, stacking more layers and adding a non-linearity tends to degrade the performance of these models.

Original: Such a phenomenon is called oversmoothing (Li et al., 2018a), which suggests that as the number of layers increases, the representations of the nodes in GCNs are inclined to converge to a certain value and become less distinct from one another.
Revised: Such a phenomenon is called oversmoothing (Li et al., 2018a), which suggests that as the number of layers increases, the representations of the nodes in GCNs are inclined to converge to a certain value and become less distinct from one another.

Original: Even adding residual connections, an effective trick for training very deep neural networks in computer vision, merely slows down the oversmoothing issue (Kipf & Welling, 2016) in GCNs.
Revised: Even adding residual connections, an effective trick for training very deep neural networks in computer vision, merely slows down the oversmoothing issue (Kipf & Welling, 2016) in GCNs.

Original: It appears that deep GCN models gain nothing but the performance degradation from the deep architecture.
Revised: It appears that deep GCN models gain nothing but the performance degradation from the deep architecture.

Original: One solution for that is only widening the aggregation function but keeping the same transformation function because the required neighbourhood size and neural network depth can be regarded as two orthogonal aspects of design.
Revised: One solution for that is only widening the aggregation function but keeping the same transformation function because the required neighbourhood size and neural network depth can be regarded as two orthogonal aspects of design.

Original: SGC (Wu et al., 2019) attempts to capture the context from K -hops neighbours in the graph by applying the K -th power of the graph convolution matrix in a single neural network layer.
Revised: SGC (Wu et al., 2019) attempts to capture the context from K -hops neighbours in the graph by applying the K -th power of the graph convolution matrix in a single neural network layer.

Original: This scheme is also used for attributed graph clustering (Zhang et al., 2019).
Revised: This scheme is also used for attributed graph clustering (Zhang et al., 2019).

Original: However, SGC is also suffering from oversmoothing as K → ∞ as shown in Theorem 1.
Revised: However, SGC is also suffering from oversmoothing as K → ∞ as shown in Theorem 1.

Original: PPNP and APPNP (Klicpera et al., 2019a) replace the power of the graph convolution matrix with the
Revised: PPNP and APPNP (Klicpera et al., 2019a) replace the power of the graph convolution matrix with the

Original: Personalized PageRank matrix to solve the oversmoothing problem.
Revised: Personalized PageRank matrix to solve the oversmoothing problem.

Original: Although APPNP relieve the oversmoothing problem, it employs a non-linear operation which requires costly computation of the derivative of the ﬁlter due to the non-linearity over the multiplication of feature matrix with learnable weights.
Revised: Although APPNP relieve the oversmoothing problem, it employs a non-linear operation which requires costly computation of the derivative of the ﬁlter due to the non-linearity over the multiplication of feature matrix with learnable weights.

Original: In contrast, we show that our approach enjoys a free derivative computed in the feedforward step thanks to the use of linear model.
Revised: In contrast, we show that our approach enjoys a free derivative computed in the feedforward step thanks to the use of linear model.

Original: Furthermore, APPNP aggregates over multiple k -hop neighborhoods but the weighting scheme favors either global or local context making it difﬁcult if not impossible to ﬁnd the balancing parameter.
Revised: Furthermore, APPNP aggregates over multiple k -hop neighborhoods but the weighting scheme favors either global or local context making it difﬁcult if not impossible to ﬁnd the balancing parameter.

Original: In contrast, our approach does aggregate over k -hop neighborhoods in a balanced manner as shown later in the text.
Revised: In contrast, our approach does aggregate over k -hop neighborhoods in a balanced manner as shown later in the text.

Original: GDC (Klicpera et al., 2019b) further extends APPNP by generalizing Personalized PageRank (Page et al., 1999) to an arbitrary graph diffusion process.
Revised: GDC (Klicpera et al., 2019b) further extends APPNP by generalizing Personalized PageRank (Page et al., 1999) to an arbitrary graph diffusion process.

Original: GDC, technically, has stronger expressive power than SGC (Wu et al., 2019), PPNP and APPNP (Klicpera et al., 2019a) but it leads to a dense transition matrix which makes the computation and space storage intractable for large graphs although authors suggest that the shrinkage method can be used to sparsify the generated transition matrix by ignoring small values.
Revised: GDC, technically, has stronger expressive power than SGC (Wu et al., 2019), PPNP and APPNP (Klicpera et al., 2019a) but it leads to a dense transition matrix which makes the computation and space storage intractable for large graphs although authors suggest that the shrinkage method can be used to sparsify the generated transition matrix by ignoring small values.

Original: To solve the above issues, we propose a Simple Spectral Graph Convolution (S 2 GC) network for node clustering (semi-supervised and unsupervised setting), node classiﬁcation and graph classiﬁcation.
Revised: To solve the above issues, we propose a Simple Spectral Graph Convolution (S 2 GC) network for node clustering (semi-supervised and unsupervised setting), node classiﬁcation and graph classiﬁcation.

Original: By analyzing Markov Diffusion Kernel (Fouss et al., 2012), we obtain a very simple and effective ﬁlter: we aggregate k -step diffusion matrices over k = 0 , · · · , K steps which is equivalent to aggregating over neighborhoods of various sizes.
Revised: By analyzing Markov Diffusion Kernel (Fouss et al., 2012), we obtain a very simple and effective ﬁlter: we aggregate k -step diffusion matrices over k = 0 , · · · , K steps which is equivalent to aggregating over neighborhoods of various sizes.

Original: Moreover, we show that our design incorporates larger neighborhoods compared to SGC thus coping better with oversmoothing.
Revised: Moreover, we show that our design incorporates larger neighborhoods compared to SGC thus coping better with oversmoothing.

Original: We explain that limiting over-dominance of the largest neighborhoods in the aggregation step is a desired approach to limit oversmoothing while preserving large context of each node.
Revised: We explain that limiting over-dominance of the largest neighborhoods in the aggregation step is a desired approach to limit oversmoothing while preserving large context of each node.

Original: We also show that in spectral analysis that S 2 GC is a trade-off between the low- and high-pass ﬁlters which leads to capturing the global and local contexts of each node.
Revised: We also show that in spectral analysis that S 2 GC is a trade-off between the low- and high-pass ﬁlters which leads to capturing the global and local contexts of each node.

Original: Moreover, we show how S 2 GC and APPNP (Klicpera et al., 2019a) are related and explain why S 2 GC captures a range of neighborhoods better than APPNP.
Revised: Moreover, we show how S 2 GC and APPNP (Klicpera et al., 2019a) are related and explain why S 2 GC captures a range of neighborhoods better than APPNP.

Original: Our experimental results include node clustering, unsupervised and semi-supervised node classiﬁcation, node property prediction and supervised text classiﬁcation.
Revised: Our experimental results include node clustering, unsupervised and semi-supervised node classiﬁcation, node property prediction and supervised text classiﬁcation.

Original: We show that S 2 GC is highly competitive often signiﬁcantly outperforming state-of-the-art methods.
Revised: We show that S 2 GC is highly competitive often signiﬁcantly outperforming state-of-the-art methods

Original:  P RELIMINARIES
Revised:  P RELIMINARIES

Original: Notations.
Revised: Notations.

Original: Let G =
Revised: Let G =

Original: ( V, E ) be a simple and connected undirected graph with n nodes and m edges.
Revised: ( V, E ) be a simple and connected undirected graph with n nodes and m edges.

Original: We use { 1 , · · · , n } to denote the node index of G , and d j denote the degree of node j in
Revised: We use { 1 , · · · , n } to denote the node index of G , and d j denote the degree of node j in

Original: G .
Revised: G .

Original: Let A be the adjacency matrix and D the diagonal degree matrix.
Revised: Let A be the adjacency matrix and D the diagonal degree matrix.

Original: Let (cid:101)
Revised: Let (cid:101)

Original: A =
Revised: A =

Original: A + I n denote the adjacency matrix with added self-loops and the corresponding diagonal degree matrix (cid:101) D where
Revised: A + I n denote the adjacency matrix with added self-loops and the corresponding diagonal degree matrix (cid:101) D where

Original: I n ∈ S n ++ is an identity matrix.
Revised: I n ∈ S n ++ is an identity matrix.

Original: Finally, let X ∈ R n × d denote the node feature matrix and each node v is associated with a d -dimensional feature vector X v .
Revised: Finally, let X ∈ R n × d denote the node feature matrix and each node v is associated with a d -dimensional feature vector X v .

Original: The normalized graph Laplacian matrix is deﬁned as L =
Revised: The normalized graph Laplacian matrix is deﬁned as L =

Original: I n − D − 1 / 2 AD − 1 / 2 ∈ S n + , a symmetric positive semideﬁnite matrix with eigendecomposition UΛU (cid:62) .
Revised: I n − D − 1 / 2 AD − 1 / 2 ∈ S n + , a symmetric positive semideﬁnite matrix with eigendecomposition UΛU (cid:62) .

Original: Here Λ is a diagonal matrix of the eigenvalues of L , and U ∈ R n × n is a unitary matrix that consists of the eigenvectors of L .
Revised: Here Λ is a diagonal matrix of the eigenvalues of L , and U ∈ R n × n is a unitary matrix that consists of the eigenvectors of L .

Original: Spectral Graph Convolution (Defferrard et al., 2016).
Revised: Spectral Graph Convolution (Defferrard et al., 2016).

Original: We consider spectral convolutions on graphs deﬁned as the multiplication of a signal x ∈ R n with a ﬁlter g θ parameterized by θ ∈ R n in the Fourier domain:
Revised: We consider spectral convolutions on graphs deﬁned as the multiplication of a signal x ∈ R n with a ﬁlter g θ parameterized by θ ∈ R n in the Fourier domain:

Original: [Equation]
Revised: [Equation]

Original: where the parameter θ ∈ R n is a vector of spectral ﬁlter coefﬁcients.
Revised: where the parameter θ ∈ R n is a vector of spectral ﬁlter coefﬁcients.

Original: We can understand g θ as a function operating on eigenvalues of L , that is g ∗ θ ( Λ ) .
Revised: We can understand g θ as a function operating on eigenvalues of L , that is g ∗ θ ( Λ ) .

Original: To avoid eigendecomposition, g θ ( Λ ) can be approximated by a truncated expansion in terms of Chebyshev polynomials T k ( Λ ) up to the K -th order (Defferrard et al., 2016):[Equation] with a rescaled ˜ Λ =
Revised: To avoid eigendecomposition, g θ ( Λ ) can be approximated by a truncated expansion in terms of Chebyshev polynomials T k ( Λ ) up to the K -th order (Defferrard et al., 2016):

Original: [Equation]
Revised: [Equation]

Original:  Λ − I [Equation] where λ max denotes the largest eigenvalue of L and θ ∈ R K is now a vector of Chebyshev coefﬁcients.
Revised: with a rescaled ˜ Λ = 1 2 λ max Λ − I n where λ max denotes the largest eigenvalue of L and θ ∈ R K is now a vector of Chebyshev coefﬁcients.

Original: Vanila Graph Convolutional Network (GCN) (Kipf & Welling, 2016).
Revised: Vanila Graph Convolutional Network (GCN) (Kipf & Welling, 2016).

Original: The vanilla GCN is a ﬁrst-order approximation of spectral graph convolutions.
Revised: The vanilla GCN is a ﬁrst-order approximation of spectral graph convolutions.

Original: If one sets K = 1 , θ 0 = 2 , and θ 1 = −for Eq.
Revised: If one sets K = 1 , θ 0 = 2 , and θ 1 = −for Eq.

Original: they obtain the convolution operation g θ ( L ) ∗ x
Revised: they obtain the convolution operation g θ ( L ) ∗ x

Original: = ( I + D − 1 / 2 AD − 1 / 2 ) x .
Revised: = ( I + D − 1 / 2 AD − 1 / 2 ) x .

Original: Finally, by the renormalization trick, replacing the matrix
Revised: Finally, by the renormalization trick, replacing the matrix

Original: I + D − 1 / 2 AD − 1 / 2 by a normalized version (cid:101) T = (cid:101)
Revised: I + D − 1 / 2 AD − 1 / 2 by a normalized version (cid:101) T = (cid:101)

Original: D − 1 / 2 (cid:101)
Revised: D − [Equation] / 2 (cid:101)

Original: A (cid:101) D − 1 / 2 =
Revised: A (cid:101) D − 1 / 2 =

Original: ( D + I n ) − 1 / 2 ( A + I n )( D + I n ) − 1 / 2 leads to the GCN layer with σ , a non-linear function, e.g . ReLU:
Revised: ( D + I n ) − 1 / 2 ( A + I n )( D + I n ) − 1 / 2 leads to the GCN layer with σ , a non-linear function, e.g . ReLU:

Original: [Equation]
Revised: [Equation]

Original: Graph Diffusion Convolution (GDC) (Klicpera et al., 2019b).
Revised: Graph Diffusion Convolution (GDC) (Klicpera et al., 2019b).

Original: A generalized graph diffusion is given by the diffusion matrix:
Revised: A generalized graph diffusion is given by the diffusion matrix:

Original: [Equation]
Revised: [Equation]

Original: with the weighting coefﬁcients θ k and the generalized transition matrix T .
Revised: with the weighting coefﬁcients θ k and the generalized transition matrix T .

Original: Eq.
Revised: Eq.

Original: 4 can be regarded as related to the Taylor expansion of matrix-valued functions.
Revised: 4 can be regarded as related to the Taylor expansion of matrix-valued functions.

Original: Thus, the choice of θ k and T k must at least ensure that Eq.
Revised: Thus, the choice of θ k and T k must at least ensure that Eq.

Original: 4 converges.
Revised: 4 converges.

Original: Klicpera et al.
Revised: Klicpera et al.

Original: (2019b) provide two special cases as low-pass ﬁlters, ie .
Revised: (2019b) provide two special cases as low-pass ﬁlters, ie .

Original: heat kernel and the kernel based on random walk with restarts.
Revised: heat kernel and the kernel based on random walk with restarts.

Original: If S denote the adjacency matrix and D be the diagonal degree matrix of S then the corresponding graph diffusion convolution is deﬁned as D − 1 / 2 SD− 1 / 2 x .
Revised: If S denote the adjacency matrix and D be the diagonal degree matrix of S then the corresponding graph diffusion convolution is deﬁned as D [Equation] [Equation] SD

Revised: [Equation]

Revised: / 2 x .

Original: Note that θ k can be a learnable parameter, or it can be chosen in one or another way.
Revised: Note that θ k can be a learnable parameter, or it can be chosen in one or another way.

Original: Many works use expansion in Eq.
Revised: Many works use expansion in Eq.

Original: 4 but different choices of θ k realise very different ﬁlters making each method unique.
Revised: 4 but different choices of θ k realise very different ﬁlters making each method unique.

Original: One example may be Chebynet (Zhang et al., 2019).
Revised: One example may be Chebynet (Zhang et al., 2019).

Original: Simple Graph Convolution (SGC) (Wu et al., 2019).
Revised: Simple Graph Convolution (SGC) (Wu et al., 2019).

Original: A classical MPNN (Gilmer et al., 2017) averages in each layer the hidden representations among 1 -hop neighbors.
Revised: A classical MPNN (Gilmer et al., 2017) averages in each layer the hidden representations among 1 -hop neighbors.

Original: This implies that each node in the k -th layer obtains feature information from all nodes that are k -hops away in the graph.
Revised: This implies that each node in the k -th layer obtains feature information from all nodes that are k -hops away in the graph.

Original: By hypothesizing that the non-linearity between GCN layers is not critical, SGC captures information from k -hops neighbourhood in the graph by applying the K -th power of the transition matrix in a single neural network layer.
Revised: By hypothesizing that the non-linearity between GCN layers is not critical, SGC captures information from k -hops neighbourhood in the graph by applying the K -th power of the transition matrix in a single neural network layer.

Original: The SGC can be regarded as a special case of GDC without nonlinearity and without the normalization by D − 1 / 2 if we set θ k = 1 and θ i<K = 0 for Eq. 5, and
Revised: The SGC can be regarded as a special case of GDC without nonlinearity and without the normalization by D − 1 / 2 if we set θ k = 1 and θ i<K = 0 for Eq. 5, and

Original: T = ˜ T :
Revised: T = ˜ T :

Original: [Equation]
Revised: [Equation]

Original: Although SGC is an efﬁcient and effective method, increasing K leads to oversmoothing.
Revised: Although SGC is an efﬁcient and effective method, increasing K leads to oversmoothing.

Original: Thus, SGC uses similar K number of layers as GCN.
Revised: Thus, SGC uses similar K number of layers as GCN.

Original: We provide Theorem 1 to demonstrate that oversmoothing is a result of convergence to the stationary distribution in graph diffusion as time t → ∞ .
Revised: We provide Theorem 1 to demonstrate that oversmoothing is a result of convergence to the stationary distribution in graph diffusion as time t → ∞ .

Original: Theorem 1.
Revised: Theorem 1.

Original: (Chung & Graham, 1997) Let λ 2 denote second largest eigenvalue of transition matrix (cid:101) T
Revised: (Chung & Graham, 1997) Let λ 2 denote second largest eigenvalue of transition matrix (cid:101) T

Original: =
Revised: =

Original: D − 1 A of a non-bipartite graph, p ( t ) be the probability distribution vector and π the stationary distribution.
Revised: D − 1 A of a non-bipartite graph, p ( t ) be the probability distribution vector and π the stationary distribution.

Original: If walk starts from the vertex i , p i (0) = 1 , then after t steps for every vertex:
Revised: If walk starts from the vertex i , p i (0) = 1 , then after t steps for every vertex:

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: APPNP.
Revised: APPNP.

Original: Klicpera et al.
Revised: Klicpera et al.

Original: (2019a)
Revised: (2019a)

Original: proposed APPNP which uses Personalized PageRank to derive a ﬁxed ﬁlter of order K .
Revised: proposed APPNP which uses Personalized PageRank to derive a ﬁxed ﬁlter of order K .

Original: Let f θ ( X ) denote the output of a two-layer fully connected neural network on the feature matrix X , the PPNP model is deﬁned as H =
Revised: Let f θ ( X ) denote the output of a two-layer fully connected neural network on the feature matrix X , the PPNP model is deﬁned as H =

Original: α I n [Equation] − 1 f θ ( X ) .
Revised: α I n − (1 − α ) (cid:101) T − 1 f θ ( X ) .

Original: To avoid calculating the inverse of matrix (cid:101) T , Klicpera et al. (2019a) also proposes Approximate PPNP (APPNP) which replaces the costly inverse with an approximation derived by the truncated power iteration:
Revised: To avoid calculating the inverse of matrix (cid:101) T , Klicpera et al. (2019a) also proposes Approximate PPNP (APPNP) which replaces the costly inverse with an approximation derived by the truncated power iteration:

Original: [Equation]
Revised: [Equation]

Original: where H (0) =
Revised: where H (0) =

Original: f θ ( X ) =
Revised: f θ ( X ) =

Original: ReLU ( XW ) .
Revised: ReLU ( XW ) .

Original: By decoupling the feature transformation and propagation steps, PPNP and APPNP aggregate information from multi-hop neighbors.
Revised: By decoupling the feature transformation and propagation steps, PPNP and APPNP aggregate information from multi-hop neighbors.

Original:  M ETHODOLOGY
Revised:  M ETHODOLOGY

Original: In this section, ﬁrstly we brieﬂy discuss the spectral analysis and graph partitioning, and conclude the small eigenvalues of a Laplacian matrix control global clustering which partitions the graph into  a few of large clusters.
Revised: In this section, ﬁrstly we brieﬂy discuss the spectral analysis and graph partitioning, and conclude the small eigenvalues of a Laplacian matrix control global clustering which partitions the graph into [Figure] a few of large clusters.

Original: Secondly, we analyze the Markov Diffusion Kernel (Fouss et al., 2012) and note that the corresponding feature mapping function acts as a low-pass ﬁlter.
Revised: Secondly, we analyze the Markov Diffusion Kernel (Fouss et al., 2012) and note that the corresponding feature mapping function acts as a low-pass ﬁlter.

Original: Finally, based on the feature mapping function we present our Simple Spectral Graph Convolution network.
Revised: Finally, based on the feature mapping function we present our Simple Spectral Graph Convolution network.

Original: [Figure]

Original: 3. S PECTRAL ANALYSIS AND GRAPH PARTITIONING
Revised: 3. S PECTRAL ANALYSIS AND GRAPH PARTITIONING

Original: Our design follows Claims I and II described in Section A.3.1 which includes their proofs.
Revised: Our design follows Claims I and II described in Section A.3.1 which includes their proofs.

Original: Claim I.
Revised: Claim I.

Original: Our ﬁlter, by design, will give the highest weight to the closest neighborhood of a node as neighborhoods N of diffusion steps k = 0 , · · · , K obey: N ( (cid:101) T 0 ) ⊆
Revised: Our ﬁlter, by design, will give the highest weight to the closest neighborhood of a node as neighborhoods N of diffusion steps k = 0 , · · · , K obey: N ( (cid:101) T 0 ) ⊆

Original: N ( (cid:101) T 1 ) ⊆ · · · ⊆ N ( (cid:101) T K ) ⊆
Revised: N ( (cid:101) T 1 ) ⊆ · · · ⊆ N ( (cid:101) T K ) ⊆

Original: N ( (cid:101) T ∞ ) .
Revised: N ( (cid:101) T ∞ ) .

Original: That is, smaller neighbourhoods belong to larger neighbourhoods too.
Revised: That is, smaller neighbourhoods belong to larger neighbourhoods too.

Original: Claim II.
Revised: Claim II.

Original: As K → ∞ , the ratio of energies contributed by S 2 GC to SGC is 0.
Revised: As K → ∞ , the ratio of energies contributed by S 2 GC to SGC is 0.

Original: Thus, the energy of inﬁnite-dimensional receptive ﬁeld (largest k ) will not dominate the sum energy of our ﬁlter.
Revised: Thus, the energy of inﬁnite-dimensional receptive ﬁeld (largest k ) will not dominate the sum energy of our ﬁlter.

Original: Thus,
Revised: Thus,

Original: S 2 GC can incorporate larger receptive ﬁelds without overbearing contributions of smaller receptive ﬁelds.
Revised: S 2 GC can incorporate larger receptive ﬁelds without overbearing contributions of smaller receptive ﬁelds.

Original: This is substantiated by Table 8 where we achieve K =16 while SGC achieves K =4 .
Revised: This is substantiated by Table 8 where we achieve K =16 while SGC achieves K =4 .

Original: 3. M ARKOV D IFFUSION K ERNEL
Revised: 3. M ARKOV D IFFUSION K ERNEL

Original: Two nodes are considered similar when they are diffused in a similar way through the graph, and therefore when they inﬂuence the other nodes in a similar manner (Fouss et al., 2012).
Revised: Two nodes are considered similar when they are diffused in a similar way through the graph, and therefore when they inﬂuence the other nodes in a similar manner (Fouss et al., 2012).

Original: In other words, two nodes are close if they are in the same cluster which has a consistent local structure.
Revised: In other words, two nodes are close if they are in the same cluster which has a consistent local structure.

Original: More precisely, the diffusion distance at time K between nodes i and j is deﬁned as follows:
Revised: More precisely, the diffusion distance at time K between nodes i and j is deﬁned as follows:

Original: [Equation]
Revised: [Equation]

Original: ) where the average visiting rate x i ( K ) after K steps for a process that started at time k = 0 is computed as follows:
Revised: where the average visiting rate x i ( K ) after K steps for a process that started at time k = 0 is computed as follows:

Original: [Equation]
Revised: [Equation]

Original: By deﬁning Z ( K ) = 1 K (cid:80)
Revised: By deﬁning Z ( K ) = 1 K (cid:80)

Original: Kk =1 T k , we reformulate Eq.
Revised: Kk =1 T k , we reformulate Eq.

Original: as a metric given as:
Revised: as a metric given as:

Original: [Equation]
Revised: [Equation]

Original: The underlying feature map of Markov Diffusion Kernel (MDK) is given as Z ( K ) x
Revised: The underlying feature map of Markov Diffusion Kernel (MDK) is given as Z ( K ) x

Original: i (0) for node i .
Revised: i (0) for node i .

Original: The effect of the linear projection Z ( K ) (ﬁlter) acting on spectrum as f ( λ ) = 1 K (cid:80) K k =

Revised: The effect of the linear projection Z ( K ) (ﬁlter) acting on spectrum as f ( λ ) = 1 K (cid:80) K k =

Original: λ k
Revised: λ k

Original: (we sum from 0 to include self-loops) is plotted in Figure 1, from which we observe the following properties: (i) Z ( K ) preserves leading (large) eigenvalues ofT and (ii) the higher K is the stricter the low-pass ﬁlter becomes but the ﬁlter also preserves the high frequency.
Revised: (we sum from 0 to include self-loops) is plotted in Figure 1, from which we observe the following properties: i ) Z ( K ) preserves leading large ) eigenvalues of

Revised: T and ii) the higher K is the stricter the low-pass ﬁlter becomes

Revised: but the ﬁlter also preserves the high frequency.

Original: In other words, as K grows, this ﬁlter includes larger and larger neighborhood but also maintains the closest locality of nodes.
Revised: In other words, as K grows, this ﬁlter includes larger and larger neighborhood but also maintains the closest locality of nodes.

Original: Note that
Revised: Note that

Original: L = I − T where L is the normalized Laplacian matrix and T is the normalized adjacency matrix.
Revised: L = I − T where L is the normalized Laplacian matrix and T is the normalized adjacency matrix.

Original: Thus keeping large positive eigenvalues for T equals keeping small eigenvalues for L .
Revised: Thus keeping large positive eigenvalues for T equals keeping small eigenvalues for L .

Original: 3. S IMPLE S PECTRAL G RAPH C ONVOLUTION
Revised: 3. S IMPLE S PECTRAL G RAPH C ONVOLUTION

Original: Based on the aforementioned Markov Diffusion Kernel, we include self-loops and we propose the
Revised: Based on the aforementioned Markov Diffusion Kernel, we include self-loops and we propose the

Original: Simple Spectral Graph Convolution (S 2 GC) network with a softmax after a linear layer:
Revised: Simple Spectral Graph Convolution (S 2 GC) network with a softmax after a linear layer:

Original: [Equation]
Revised: [Equation]

Original: As K → ∞ , H = (cid:80) ∞ k =1 (cid:101) T k is the optimal diffused representation of the normalized Laplacian
Revised: As K → ∞ , H = (cid:80) ∞ k =1 (cid:101) T k is the optimal diffused representation of the normalized Laplacian

Original: Regularization problem (Chapelle et al., 2006):
Revised: Regularization problem (Chapelle et al., 2006):

Original: [Equation]
Revised: [Equation]

Original: where each vector h i denotes the i -th row of H .
Revised: where each vector h i denotes the i -th row of H .

Original: However, the inﬁnite expansion resulting from Eq.
Revised: However, the inﬁnite expansion resulting from Eq.

Original: 12 in fact is suboptimal due to oversmoothing (Fig.
Revised: 12 in fact is suboptimal due to oversmoothing (Fig.

Original: 8 shows this).
Revised: 8 shows this).

Original: In contrast, we include in Eq.a self-loop (cid:101) T 

Revised: In contrast, we include in Eq.a self-loop (cid:101) T

Original: =
Revised: =

Original: I , the α ∈ [0 , 1] parameter (Fig.
Revised: I , the α ∈ [0 , 1] parameter (Fig.

Original: 9 evaluates its impact) to balance the node’s self information vs .
Revised: 9 evaluates its impact) to balance the node’s self information vs .

Original: consecutive neighborhoods, and we consider ﬁnite K .
Revised: consecutive neighborhoods, and we consider ﬁnite K .

Original: We generalize the Eq.
Revised: We generalize the Eq.

Original: 11 as:
Revised: 11 as:

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: Relation
Revised: Relation

Original: of S 2 GC
Revised: of S 2 GC

Original: to
Revised: to

Original: GDC
Revised: GDC

Original: GDC uses the entire ﬁlter matrix S ( n × n ) as S is then re-normalized by its degree.
Revised: GDC uses the entire ﬁlter matrix S ( n × n ) as S is then re-normalized by its degree.

Original: Klicpera et al.
Revised: Klicpera et al.

Original: (2019b) explain that ‘Most graph diffusions result in a dense matrix S .
Revised: (2019b) explain that ‘Most graph diffusions result in a dense matrix S .

Original: In contrast, our approach is simply computed as ( (cid:80)
Revised: In contrast, our approach is simply computed as ( (cid:80)

Original: Kk =1 (cid:101) T k X ) W (plus self-loop) where X is of size ( n × d ) where d (cid:28) n , n and d being the number of nodes and features, respectively.
Revised: Kk =1 (cid:101) T k X ) W (plus self-loop) where X is of size ( n × d ) where d (cid:28) n , n and d being the number of nodes and features, respectively.

Original: The (cid:101) T τ X step is computed as (cid:101) T · ( (cid:101) T · ( · · · ( (cid:101) TX ) · · · )) which requires t matrix-matrix multiplications between matrices of size n × n and n × d .
Revised: The (cid:101) T τ X step is computed as (cid:101) T · ( (cid:101) T · ( · · · ( (cid:101) TX ) · · · )) which requires t matrix-matrix multiplications between matrices of size n × n and n × d .

Original: Thus, S 2 GC can handle extremely large graphs as it does not need to sparsify dense ﬁlter matrices as GDC.
Revised: Thus, S 2 GC can handle extremely large graphs as it does not need to sparsify dense ﬁlter matrices as GDC.

Original: Relation of S 2 GC to APPNP.
Revised: Relation of S 2 GC to APPNP.

Original: Let us deﬁne H 

Revised: Let us deﬁne H

Original: = XW as we use the linear step in our S 2 GC.
Revised: = XW as we use the linear step in our S 2 GC.

Original: Then and only then, for l = 0 and H 0 = XW , APPNP expansion yields H 1 =
Revised: Then and only then, for l = 0 and H 0 = XW , APPNP expansion yields H 1 =

Original: (1 − α )
Revised: (1 − α )

Original: (cid:101) TXW + α XW =
Revised: (cid:101) TXW + α XW =

Original: ((1 − α ) (cid:101) T + α I ) XW which is equal to our Z (1) XW
Revised: ((1 − α ) (cid:101) T + α I ) XW which is equal to our Z (1) XW

Original: =
Revised: =

Original: ( (cid:80) Kk =

Revised: ( (cid:80) Kk =

Original: (cid:101) T k ) XW
Revised: (cid:101) T k ) XW

Original: = (cid:101) TX + X = ( (cid:101) T + I ) XW
Revised: = (cid:101) TX + X = ( (cid:101) T + I ) XW

Original: if α = 0 .
Revised: if α = 0 .

Original: 5 , K =1 , except for scaling (constant) of H 1 .
Revised: 5 , K =1 , except for scaling (constant) of H 1 .

Original: In contrast, for l = 1 and general case H 

Revised: In contrast, for l = 1 and general case H

Original: = f
Revised: = f

Original: ( X ; W ) , APPNP yields H 2 =
Revised: ( X ; W ) , APPNP yields H 2 =

Original: (1 − α ) 2 (cid:101) T 2 f
Revised: (1 − α ) 2 (cid:101) T 2 f

Original: ( X ; W )
Revised: ( X ; W )

Original: + (1 − α )
Revised: + (1 − α )

Original: α (cid:101) T f ( X ; W )+ αf
Revised: α (cid:101) T f ( X ; W )+ αf

Original: ( X ; W ) from which is is easy to note speciﬁc weight coefﬁcients (1 − α ) 2 , (1 − α )
Revised: ( X ; W ) from which is is easy to note speciﬁc weight coefﬁcients (1 − α ) 2 , (1 − α )

Original: α and α associated with 2 -, 1 -, and 0 -hops.
Revised: α and α associated with 2 -, 1 -, and 0 -hops.

Original: This shows that the APPNP expansion is very different to S 2 GC expansion in Eq.
Revised: This shows that the APPNP expansion is very different to S 2 GC expansion in Eq.

Original: In fact, S 2 G and APPNP are only equivalent if α = 0 .
Revised: In fact, S 2 G and APPNP are only equivalent if α = 0 .

Original: K = 1 and a linear transformation f is used.
Revised: K = 1 and a linear transformation f is used.

Original: Moreover, APPNP assumes H 

Revised: Moreover, APPNP assumes H

Original: = f
Revised: = f

Original: ( X ; W ) =
Revised: ( X ; W ) =

Original: ReLU ( XW ) , thus their optimizer has to backpropagate through f ( X ; W ) to obtain ∂f∂ W and multiply this with the above expansion e.g .,
Revised: ReLU ( XW ) , thus their optimizer has to backpropagate through f ( X ; W ) to obtain ∂f∂ W and multiply this with the above expansion e.g .,

Original: [Equation]
Revised: [Equation]

Original: In contrast, we use the linear function XW .
Revised: In contrast, we use the linear function XW .

Original: Thus, ∂ XW ∂ W yields X .
Revised: Thus, ∂ XW ∂ W yields X .

Original: Thus, the multiplication of our expansion with X for the backprop step is in fact obtained in the forward pass which makes our approx very fast for large graphs.
Revised: Thus, the multiplication of our expansion with X for the backprop step is in fact obtained in the forward pass which makes our approx very fast for large graphs.

Original: Relation of S 2 GC to AR.
Revised: Relation of S 2 GC to AR.

Original: The AR ﬁlter (Li et al., 2019) uses the regularized Laplacian kernel (Smola & Kondor, 2003) which differs from used by us (modiﬁed)
Revised: The AR ﬁlter (Li et al., 2019) uses the regularized Laplacian kernel (Smola & Kondor, 2003) which differs from used by us (modiﬁed)

Original: Markov diffusion kernel.
Revised: Markov diffusion kernel.

Original: Specifically, the regularized Laplacian kernel uses the negated Laplacian matrix yielding − L as follows:
Revised: Specifically, the regularized Laplacian kernel uses the negated Laplacian matrix yielding − L as follows:

Original: K L = (cid:80) ∞
Revised: K L = (cid:80) ∞

Original: k =

Revised: k =

Original: α k ( − L ) k
Revised: α k ( − L ) k

Original: =( I + α L ) − 1 where L = I − (cid:101) T which is related to the von Neumann diffusion kernel K vN = (cid:80) ∞
Revised: =( I + α L ) − 1 where L = I − (cid:101) T which is related to the von Neumann diffusion kernel K vN = (cid:80) ∞

Original: k =

Revised: k =

Original: α k A k .
Revised: α k A k .

Original: In contrast, the Markov diffusion kernel K MD ( K ) =
Revised: In contrast, the Markov diffusion kernel K MD ( K ) =

Original: Z ( K ) Z T ( K )
Revised: Z ( K ) Z T ( K )

Original: where Z ( K )
Revised: where Z ( K )

Original: = 1 K (cid:80)
Revised: = 1 K (cid:80)

Original: Kk =1 (cid:101) T k , where (cid:101) T
Revised: Kk =1 (cid:101) T k , where (cid:101) T

Original: =
Revised: =

Original: D − 1 / 2 AD − 1 / 2 .
Revised: D − 1 / 2 AD − 1 / 2 .

Original: [Table]
Revised: [Table]

Original: | E | d + Knd ≈ K | E | n
Revised: | E | d + Knd ≈ K | E | n

Original: K | E | d
Revised: K | E | d

Original: K | E | d + Knd
Revised: K | E | d + Knd

Original: [Table]
Revised: [Table]

Original: nd
Revised: nd

Original: [Table]
Revised: [Table]

Original: | E |
Revised: | E |

Original: ≈ nnd + | E | nd + | E |
Revised: ≈ nnd + | E | nd + | E |

Original: [Table]
Revised: [Table]

Original: [Table]
Revised: [Table]

Original: Relation of S 2 GC to Jumping Knowledge Network (JKN).
Revised: Relation of S 2 GC to Jumping Knowledge Network (JKN).

Original: Xu et al.
Revised: Xu et al.

Original: (2018b) combine intermediate node representations from each layer by concatenating them in the ﬁnal layer.
Revised: (2018b) combine intermediate node representations from each layer by concatenating them in the ﬁnal layer.

Original: However, (Xu et al., 2018b) use non-linear layers which results in a completely different network architecture and the usual slower processing due to complex backpropagation chain.
Revised: However, (Xu et al., 2018b) use non-linear layers which results in a completely different network architecture and the usual slower processing due to complex backpropagation chain.

Original: 3. C OMPLEXITY A NALYSIS
Revised: 3. C OMPLEXITY A NALYSIS

Original: For S 2 GC, the storage costs is O ( | E | + nd ) , where | E | is the total edge count, nd relates to saving the (cid:101)
Revised: For S 2 GC, the storage costs is O ( | E | + nd ) , where | E | is the total edge count, nd relates to saving the (cid:101)

Original: T k X during intermediate multiplications (cid:101) T · ( (cid:101) T · ( · · · ( (cid:101) TX ) · · · )) .
Revised: T k X during intermediate multiplications (cid:101) T · ( (cid:101) T · ( · · · ( (cid:101) TX ) · · · )) .

Original: The computational cost is the O ( K | E | d + Knd ) .
Revised: The computational cost is the O ( K | E | d + Knd ) .

Original: Each sparse matrix multiplication (cid:101) TX costs | E | d
Revised: Each sparse matrix multiplication (cid:101) TX costs | E | d

Original: and we need K such multiplications while Knd realises summation over ﬁlters and nd is the cost of adding features X .
Revised: and we need K such multiplications while Knd realises summation over ﬁlters and nd is the cost of adding features X .

Original: In contrast, the storage cost of GDC is approximately O ( n 2 ) and the computational cost is approximately O
Revised: In contrast, the storage cost of GDC is approximately O ( n 2 ) and the computational cost is approximately O

Original: ( K | E | n ) where n is the node numbers, K is the order of terms and | E | is the number of graph edges.
Revised: ( K | E | n ) where n is the node numbers, K is the order of terms and | E | is the number of graph edges.

Original: APPNP, SGC and S 2 GC have much lower cost than GDC.
Revised: APPNP, SGC and S 2 GC have much lower cost than GDC.

Original: Kindly note K | E | d (cid:29) Knd and n (cid:29) d .
Revised: Kindly note K | E | d (cid:29) Knd and n (cid:29) d .

Original: We found that APPNP, SGC and S 2 GC have similar computational and storage costs in the forward stage.
Revised: We found that APPNP, SGC and S 2 GC have similar computational and storage costs in the forward stage.

Original: Note that the d in APPNP is not the dimension of features X but f ( X ) , which is the number of categories.
Revised: Note that the d in APPNP is not the dimension of features X but f ( X ) , which is the number of categories.

Original: For the backward stage including computing the gradient of the classiﬁcation step, the computational costs of GDC, SGC and S 2 GC are independent of K and | E | because the graph convolution for these methods does not require backprop (grad.
Revised: For the backward stage including computing the gradient of the classiﬁcation step, the computational costs of GDC, SGC and S 2 GC are independent of K and | E | because the graph convolution for these methods does not require backprop (grad.

Original: is computed in the forward step).
Revised: is computed in the forward step).

Original: In contrast, APPNP requires backprop as explained earlier.
Revised: In contrast, APPNP requires backprop as explained earlier.

Original: Table 1 summarizes the computational and storage costs of several methods.
Revised: Table 1 summarizes the computational and storage costs of several methods.

Original: Table 2 demonstrates that APPNP is over 66 × slower than S 2 GC on large scale Products dataset (OGB benchmark) despite, for fairness, we use the same basic building blocks of PyTorch among compared methods.
Revised: Table 2 demonstrates that APPNP is over 66 × slower than S 2 GC on large scale Products dataset (OGB benchmark) despite, for fairness, we use the same basic building blocks of PyTorch among compared methods.

Original:  E XPERIMENTS
Revised:  E XPERIMENTS

Original: In this section, we evaluate the proposed method on four different tasks: node clustering, community prediction, semi-supervised node classiﬁcation and text classiﬁcation.
Revised: In this section, we evaluate the proposed method on four different tasks: node clustering, community prediction, semi-supervised node classiﬁcation and text classiﬁcation.

Original: 4. N ODE C LUSTERING
Revised: 4. N ODE C LUSTERING

Original: We compare S 2 GC with three kinds of clustering methods: (i) Methods that only use node features: k-means and spectral clustering (spectral-f) that constructs a similarity matrix with the node features by a linear kernel.
Revised: We compare S 2 GC with three kinds of clustering methods: (i) Methods that only use node features: k-means and spectral clustering (spectral-f) that constructs a similarity matrix with the node features by a linear kernel.

Original: (ii) Structural clustering methods that only use graph structures: spectral clustering (spectral-g) that takes the node adjacency matrix as the similarity matrix, DeepWalk (Perozzi et al., 2014), and (iii) Attributed graph clustering methods that utilize both node features and graph structures: Graph Autoencoder (GAE) and Graph Variational Autoencoder (VGAE)
Revised: (ii) Structural clustering methods that only use graph structures: spectral clustering (spectral-g) that takes the node adjacency matrix as the similarity matrix, DeepWalk (Perozzi et al., 2014), and (iii) Attributed graph clustering methods that utilize both node features and graph structures: Graph Autoencoder (GAE) and Graph Variational Autoencoder (VGAE)

Original: (Kipf & Welling, 2016), and Adversarially Regularized Graph Autoencoder (ARGE),
Revised: (Kipf & Welling, 2016), and Adversarially Regularized Graph Autoencoder (ARGE),

Original: Graph
Revised: Graph

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table]
Revised: [Table]

Original: Autoencoder (ARVGE) (Pan et al., 2018) and AGC (Zhang et al., 2019).
Revised: Autoencoder (ARVGE) (Pan et al., 2018) and AGC (Zhang et al., 2019).

Original: To evaluate the clustering performance, three performance measures are adopted: clustering Accuracy (Acc), Normalized Mutual Information (NMI) and macro F1-score (F1).
Revised: To evaluate the clustering performance, three performance measures are adopted: clustering Accuracy (Acc), Normalized Mutual Information (NMI) and macro F1-score (F1).

Original: We run each method 10 times on four datasets:
Revised: We run each method 10 times on four datasets:

Original: Cora, CiteSeer, PubMed, and Wiki, and we report the average clustering results in Table 3, where top-1 results are highlighted in bold.
Revised: Cora, CiteSeer, PubMed, and Wiki, and we report the average clustering results in Table 3, where top-1 results are highlighted in bold.

Original: To adaptively select the order k , we use the clustering performance metric: internal criteria based on the information intrinsic to the data alone Zhang et al.
Revised: To adaptively select the order k , we use the clustering performance metric: internal criteria based on the information intrinsic to the data alone Zhang et al.

Original: 4. C OMMUNITY P REDICTION
Revised: 4. C OMMUNITY P REDICTION

Original: We supplement our social network analysis by using S 2 GC to inductively predict the community structure on Reddit, a large scale dataset as shown in Table 11 which cannot be processed by the vanilla GCN Kipf & Welling (2016) and GDC (Klicpera et al., 2019b) due to the memory issues.
Revised: We supplement our social network analysis by using S 2 GC to inductively predict the community structure on Reddit, a large scale dataset as shown in Table 11 which cannot be processed by the vanilla GCN Kipf & Welling (2016) and GDC (Klicpera et al., 2019b) due to the memory issues.

Original: On the Reddit dataset, we train S 2 GC with L-BFGS using no regularization, and we set K = 5 and α = 0 .
Revised: On the Reddit dataset, we train S 2 GC with L-BFGS using no regularization, and we set K = 5 and α = 0 .

Original: We evaluate S 2 GC inductively according to protocol (Chen et al., 2018).
Revised: We evaluate S 2 GC inductively according to protocol (Chen et al., 2018).

Original: We train S 2 GC on a subgraph comprising only training nodes and test on the original graph.
Revised: We train S 2 GC on a subgraph comprising only training nodes and test on the original graph.

Original: On all datasets, we tune the number of epochs based on both convergence behavior and the obtained validation accuracy.
Revised: On all datasets, we tune the number of epochs based on both convergence behavior and the obtained validation accuracy.

Original: For Reddit, we compare S 2 GC to the reported performance of supervised and unsupervised variants of GraphSAGE (Hamilton et al., 2017), FastGCN (Chen et al., 2018), SGC (Wu et al., 2019) and
Revised: For Reddit, we compare S 2 GC to the reported performance of supervised and unsupervised variants of GraphSAGE (Hamilton et al., 2017), FastGCN (Chen et al., 2018), SGC (Wu et al., 2019) and

Original: DGI (Velickovic et al., 2019).
Revised: DGI (Velickovic et al., 2019).

Original: Table 4 also highlights the setting of the feature extraction step for each method.
Revised: Table 4 also highlights the setting of the feature extraction step for each method.

Original: Note that S 2 GC and SGC involve no learning because they do not learn any parameters to extract features.
Revised: Note that S 2 GC and SGC involve no learning because they do not learn any parameters to extract features.

Original: The logistic regression is used as a classiﬁer for both unsupervised and no-learning approaches to train with labels afterward.
Revised: The logistic regression is used as a classiﬁer for both unsupervised and no-learning approaches to train with labels afterward.

Original: 4. N ODE C LASSIFICATION
Revised: 4. N ODE C LASSIFICATION

Original: For the semi-supervised node classiﬁcation task, we apply the standard ﬁxed training/validation/testing split (Yang et al., 2016) on the Cora, Citeseer, and Pubmed datasets, with 20 nodes per class for training, 500 nodes for validation and 1,000 nodes for testing.
Revised: For the semi-supervised node classiﬁcation task, we apply the standard ﬁxed training/validation/testing split (Yang et al., 2016) on the Cora, Citeseer, and Pubmed datasets, with 20 nodes per class for training, 500 nodes for validation and 1,000 nodes for testing.

Original: For baselines,
Revised: For baselines,

Original: We include three state-of-the-art shallow models: GCN (Kipf & Welling, 2016), GAT (Veliˇckovi´c et al., 2017), FastGCN (Chen et al., 2018), APPNP (Klicpera et al., 2019a), Mixhop (Abu-El-Haija et al., 2019), SGC (Wu et al., 2019), DGI (Velickovic et al., 2019) and GIN (Xu et al., 2018a).
Revised: We include three state-of-the-art shallow models: GCN (Kipf & Welling, 2016), GAT (Veliˇckovi´c et al., 2017), FastGCN (Chen et al., 2018), APPNP (Klicpera et al., 2019a), Mixhop (Abu-El-Haija et al., 2019), SGC (Wu et al., 2019), DGI (Velickovic et al., 2019) and GIN (Xu et al., 2018a).

Original: We use the Adam SGD optimizer (Kingma & Ba, 2014) with a learning rate of 0.02 to train S 2 GC.
Revised: We use the Adam SGD optimizer (Kingma & Ba, 2014) with a learning rate of 0.02 to train S 2 GC.

Original: We set α = 0 .
Revised: We set α = 0 .

Original: 05 and K
Revised: 05 and K

Original: = 16 on all datasets.
Revised: = 16 on all datasets.

Original: We perform a grid search to tune the weight decay for models with different depths based on theaccuracy and loss of the validation set.{+set of Cora. Following that, we ﬁxed K = 
+}
Revised: To determine K and α , we used the MetaOpt package Bergstra et al. (2015) with 20 steps to meta-optimize hyperparameters on the validation {+set of Cora. Following that, we ﬁxed K = 
+}

Revised: and α = 0 .

Revised: across all datasets so K and α are not tuned to individual datasets at all.

Original: We will discuss the inﬂuences of α and K later.
Revised: We will discuss the inﬂuence of α and K later.

Original: To evaluate the proposed method on large scale benchmarks, we use ogbn-arxiv, ogbn-mag and ogbn-products to demonstrate the comparison among the proposed method, SGC, GraphSage, GCN,
Revised: To evaluate the proposed method on large scale benchmarks, we use ogbn-arxiv, ogbn-mag and ogbn-products to demonstrate the comparison among the proposed method, SGC, GraphSage, GCN,

Original: MLP and Softmax (multinomial Regression), as shown in Table 6.
Revised: MLP and Softmax (multinomial Regression), as shown in Table 6.

Original: In these three datasets, our method outperforms SGC consistently.
Revised: In these three datasets, our method outperforms SGC consistently.

Original: In ogbn-arxiv and ogbn-products, we can observe our method cannot outperforms GCN and GraphSage while MLP outperforms softmax classiﬁer signiﬁcantly.
Revised: In ogbn-arxiv and ogbn-products, we can observe our method cannot outperforms GCN and GraphSage while MLP outperforms softmax classiﬁer signiﬁcantly.

Original: Thus we argue in these two datasets, MLP plays a more important role than graph convolution.
Revised: Thus we argue in these two datasets, MLP plays a more important role than graph convolution.

Original: To prove this point, we also conduct the experiment (S 2 GC+MLP) that we use MLP to replace the linear classiﬁer and obtain a more powerful S 2 GC.
Revised: To prove this point, we also conduct the experiment (S 2 GC+MLP) that we use MLP to replace the linear classiﬁer and obtain a more powerful S 2 GC.

Original: In ogbn-mag, MLP barely helps ourmethod because the performance of MLP is close to the one of Softmax. In other two datasets, the
Revised: In ogbn-mag, MLP barely helps our

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table]
Revised: [Table]

Revised: method because the performance of MLP is close to the one of Softmax.

Original:  signiﬁcant improvements are easy to observe that S 2 GC with MLP is more close to GCN and even outperform it.
Revised: In other two datasets, the signiﬁcant improvements are easy to observe that S 2 GC with MLP is more close to GCN and even outperform it.

Original: 4. T EXT C LASSIFICATION
Revised: 4. T EXT C LASSIFICATION

Original: Text classiﬁcation predicts the labels of documents.
Revised: Text classiﬁcation predicts the labels of documents.

Original: Yao et al.
Revised: Yao et al.

Original: (2019) use a 2-layer GCN to achieve state-of-the-art results by creating a corpus-level graph which treats both documents and words as nodes in a graph.
Revised: (2019) use a 2-layer GCN to achieve state-of-the-art results by creating a corpus-level graph which treats both documents and words as nodes in a graph.

Original: Word-to-word edge weights are given by Point-wise Mutual Information (PMI) and word-document edge weights are given by normalized TF-IDF scores.
Revised: Word-to-word edge weights are given by Point-wise Mutual Information (PMI) and word-document edge weights are given by normalized TF-IDF scores.

Original: We ran our experiments on ﬁve widely used benchmark corpora including movie review (MR), 20-Newsgroups (20NG), Ohsumed, R52 and R8 of Reuters 21578.
Revised: We ran our experiments on ﬁve widely used benchmark corpora including movie review (MR), 20-Newsgroups (20NG), Ohsumed, R52 and R8 of Reuters 21578.

Original: We ﬁrst preprocessed all the datasets by cleaning and tokenizing text as (Kim, 2014).
Revised: We ﬁrst preprocessed all the datasets by cleaning and tokenizing text as (Kim, 2014).

Original: We then removed stop words deﬁned in
Revised: We then removed stop words deﬁned in

Original: NLTK6 and low frequency words appearing less than 5 times for 20NG, R8, R52 and Ohsumed.
Revised: NLTK6 and low frequency words appearing less than 5 times for 20NG, R8, R52 and Ohsumed.

Original: We compare two state-of-the-art models with our method: GCN (Kipf & Welling, 2016) and SGC (Wu et al., 2019).
Revised: We compare two state-of-the-art models with our method: GCN (Kipf & Welling, 2016) and SGC (Wu et al., 2019).

Original: The statistics of the preprocessed datasets are summarized in Table 12.
Revised: The statistics of the preprocessed datasets are summarized in Table 12.

Original: Table 7 shows that an S 2 GC rivals their models on 5 benchmark datasets.
Revised: Table 7 shows that an S 2 GC rivals their models on 5 benchmark datasets.

Original: We give the parameters setting in the supplementary material.
Revised: We give the parameters setting in the supplementary material.

Original: 4. A DETAILED COMPARISON WITH VARIOUS NUMBERS OF LAYERS AND α
Revised: 4. A DETAILED COMPARISON WITH VARIOUS NUMBERS OF LAYERS AND α

Original: Table 8 summaries the results for the deep models with various numbers of layers (or K for SGC and our methods).
Revised: Table 8 summaries the results for the deep models with various numbers of layers (or K for SGC and our methods).

Original: We observe that on Cora, Citeseer and Pubmed that our method consistently obtains the best performance with K = 16 equivalent of 16 layers.
Revised: We observe that on Cora, Citeseer and Pubmed that our method consistently obtains the best performance with K = 16 equivalent of 16 layers.

Original: Overall, the results suggestthat with S 2 GC, we can aggregate over larger neighborhood than SGC thus we suffer less from
Revised: Overall, the results suggest

Original: [Table]
Revised: [Table]

Revised: [Table]

Original: [Table]
Revised: [Table]

Revised: that with S 2 GC

Original: [Table]
Revised: [Table]

Original:  oversmoothing.
Revised: we can aggregate over larger neighborhood than SGC thus we suffer less from oversmoothing.

Original: On the other hand, the performance of GCN and SGC drops rapidly as the number of layers exceeds 32 due to oversmoothing.
Revised: On the other hand, the performance of GCN and SGC drops rapidly as the number of layers exceeds 32 due to oversmoothing

Original:  Table 9 summaries the results for the proposed method for various α ranged from 0 to 0.15.
Revised: [Table] Table 9 summaries the results for the proposed method for various α ranged from 0 to 0.15.

Original: As we can observe, α only slightly improves the performance of S 2 GC.
Revised: As we can observe, α only slightly improves the performance of S 2 GC.

Original: Thus.
Revised: Thus.

Original: balancing self-loop by α with other ﬁlters of consecutively larger receptive ﬁelds is useful but the self-loop is not mandatory.
Revised: balancing self-loop by α with other ﬁlters of consecutively larger receptive ﬁelds is useful but the self-loop is not mandatory

Original: [Table]
Revised: [Table]

Original: [Table]
Revised: [Table]

Original: G RAPH C LASSIFICATION
Revised: G RAPH C LASSIFICATION

Original: We report the average accuracy of 10-fold cross validation on a number of common benchmark datasets (as shown in Table 10)
Revised: We report the average accuracy of 10-fold cross validation on a number of common benchmark datasets (as shown in Table 10)

Original: [Table]
Revised: [Table]

Original: where we randomly sample a training fold to serve as a validation set.
Revised: where we randomly sample a training fold to serve as a validation set.

Original: We only make use of discrete node features.
Revised: We only make use of discrete node features.

Original: In case they are not given, we use one-hot encodings of node degrees as feature input.
Revised: In case they are not given, we use one-hot encodings of node degrees as feature input.

Original: We note that graph classiﬁcation is a task highly dependent on the global pooling strategy.
Revised: We note that graph classiﬁcation is a task highly dependent on the global pooling strategy.

Original: There exist methods that apply sophisticated mechanisms for this step.
Revised: There exist methods that apply sophisticated mechanisms for this step.

Original: However, with a simple average pooling and a highly scalable S 2 GC model, we comfortably outperform all methods on MUTAG, Proteins and IMDB-Binary.
Revised: However, with a simple average pooling and a highly scalable S 2 GC model, we comfortably outperform all methods on MUTAG, Proteins and IMDB-Binary.

Original:  C ONCLUSIONS
Revised:  C ONCLUSIONS

Original: We have proposed Simple Spectral Graph Convolution (S 2 GC), a method based on the Markov
Revised: We have proposed Simple Spectral Graph Convolution (S 2 GC), a method based on the Markov

Original: Diffusion Kernel (Section 3.2) whose feature maps emerge from the normalized Laplacian Regularization problem (Section 3.3).
Revised: Diffusion Kernel (Section 3.2) whose feature maps emerge from the normalized Laplacian Regularization problem (Section 3.3).

Original: The theoretical analysis shows that S 2 GC beneﬁts from the right level of trade-off in the aggregation over consecutively larger receptive ﬁelds.
Revised: The theoretical analysis shows that S 2 GC beneﬁts from the right level of trade-off in the aggregation over consecutively larger receptive ﬁelds.

Original: We have shown there exist a connection between S 2 GC and other methods such as SGC, APPNP and JKN by analyzing spectral properties and implementation of each model.
Revised: We have shown there exist a connection between S 2 GC and other methods such as SGC, APPNP and JKN by analyzing spectral properties and implementation of each model.

Original: However, ac our Claims I and II show, we have designed a ﬁlter with unique properties to capture larger context while limiting oversmoothing.
Revised: However, ac our Claims I and II show, we have designed a ﬁlter with unique properties to capture larger context while limiting oversmoothing.

Original: S 2 GC inherits many of the strengths of spectral methods and none of their weaknesses, e.g . oversmoothing.
Revised: S 2 GC inherits many of the strengths of spectral methods and copes better with oversmoothing (larger K si achieved).

Original: We have conducted extensive and rigorous experiments that have shown that S 2 GC is competitive and frequently outperforms many state-of-the-art methods on unsupervised, semi-supervised and supervised tasks and several popular datasets.
Revised: We have conducted extensive and rigorous experiments that have shown that S 2 GC is competitive and frequently outperforms many state-of-the-art methods on unsupervised, semi-supervised and supervised tasks and several popular datasets.

Original: A S UPPLEMENTARY M ATERIAL A. N ODE C LUSTERING
Revised: A S UPPLEMENTARY M ATERIAL A. N ODE C LUSTERING

Original: For S 2 GC and AGC we set max iterations to 60 .
Revised: For S 2 GC and AGC, we set max iterations to 60 .

Original: For other baselines, we follow the parameter settings in the original papers.
Revised: For other baselines, we follow the parameter settings in the original papers.

Original: In particular, for DeepWalk, the number of random walks is 10, the number of latent dimensions for each node is  and the path length of each random walk is 80.
Revised: In particular, for DeepWalk, the number of random walks is 10, the number of latent dimensions for each node is 128, and the path length of each random walk is 80.

Original: For DNGR, the autoencoder is of three layers with 512 neurons and 256 neurons in the hidden layers respectively.
Revised: For DNGR, the autoencoder is of three layers with 512 neurons and 256 neurons in the hidden layers respectively.

Original: For GAE and VGAE, we construct encoders with a 32-neuron hidden layer and[Table] a 16-neuron embedding layer, and train the encoders for 200 iterations using the Adam optimizer with learning rate equal 0.01.
Revised: For GAE and VGAE, we construct encoders with a 32-neuron hidden layer and a 16-neuron embedding layer, and train the encoders for 200 iterations using the Adam optimizer with learning rate equal 0.01.

Original: For ARGE and ARVGE, we construct encoders with a 32-neuron hidden layer and a 16-neuron embedding layer.
Revised: For ARGE and ARVGE, we construct encoders with a 32-neuron hidden layer and a 16-neuron embedding layer.

Original: The discriminators are built by two hidden layers with 16 and 64 neurons respectively.
Revised: The discriminators are built by two hidden layers with 16 and 64 neurons respectively.

Original: On Cora, Citeseer and Wiki, we train the autoencoder-related models of ARGE and ARVGE for 200 iterations with the Adam optimizer, with the encoder and discriminator learning rates both set as 0.001; on Pubmed, we train them for 2000 iterations with the encoder learning rate 0.001 and the discriminator learning rate 0.008.
Revised: On Cora, Citeseer and Wiki, we train the autoencoder-related models of ARGE and ARVGE for 200 iterations with the Adam optimizer, with the encoder and discriminator learning rates both set as 0.001; on Pubmed, we train them for 2000 iterations with the encoder learning rate 0.001 and the discriminator learning rate 0.008.

Original: A. T EXT C LASSIFICATION
Revised: A. T EXT C LASSIFICATION

Original: The 20NG dataset1 (bydate version) contains 18,846 documents evenly categorized into 20 different categories.
Revised: The 20NG dataset1 (bydate version) contains 18,846 documents evenly categorized into 20 different categories.

Original: In total, 11,314 documents are in the training set and 7,532 documents are in the test set.
Revised: In total, 11,314 documents are in the training set and 7,532 documents are in the test set.

Original: The Ohsumed corpus2 is from the MEDLINE database, which is a bibliographic database of important medical literature maintained by the National Library of Medicine.
Revised: The Ohsumed corpus2 is from the MEDLINE database, which is a bibliographic database of important medical literature maintained by the National Library of Medicine.

Original: In this work, we used the 13,929 unique cardiovascular diseases abstracts in the ﬁrst 20,000 abstracts of the year 1991.
Revised: In this work, we used the 13,929 unique cardiovascular diseases abstracts in the ﬁrst 20,000 abstracts of the year 1991.

Original: Each document in the set has one or more associated categories from the 23 disease categories.
Revised: Each document in the set has one or more associated categories from the 23 disease categories.

Original: As we focus on single-label text classiﬁcation, the documents belonging to multiple categories are excluded so that 7,400 documents belonging to only one category remain.
Revised: As we focus on single-label text classiﬁcation, the documents belonging to multiple categories are excluded so that 7,400 documents belonging to only one category remain.

Original: 3,357 documents are in the training set and 4,043 documents are in the test set.
Revised: 3,357 documents are in the training set and 4,043 documents are in the test set.

Original: R52 and R8 (all-terms version) are two subsets of the Reuters 21578 dataset.
Revised: R52 and R8 (all-terms version) are two subsets of the Reuters 21578 dataset.

Original: R8 has 8 categories, and was split to 5,485 training and 2,189 test documents.
Revised: R8 has 8 categories, and was split to 5,485 training and 2,189 test documents.

Original: R52 has 52 categories, and was split to 6,532 training and 2,568 test documents.
Revised: R52 has 52 categories, and was split to 6,532 training and 2,568 test documents.

Original: MR is a movie review dataset for binary sentiment classiﬁcation, in which each review only contains one sentence (Pang & Lee, 2005)
Revised: MR is a movie review dataset for binary sentiment classiﬁcation, in which each review only contains one sentence (Pang & Lee, 2005)

Original: The corpus has 5,331 positive and 5,331 negative reviews.
Revised: The corpus has 5,331 positive and 5,331 negative reviews.

Original: We used the training/test split in (Tang et al., 2015).
Revised: We used the training/test split in (Tang et al., 2015).

Original: A. O PEN G RAPH B ENCHMARK : N ODE P ROPERTY P REDICTION A.3. T EXT C LASSIFICATION
Revised: A. O PEN G RAPH B ENCHMARK : N ODE P ROPERTY P REDICTION A.3. T EXT C LASSIFICATION

Original: Parameters.
Revised: Parameters.

Original: We follow the setting of Text GCN (Yao et al., 2019) that includes experiments on four widely used benchmark corpora such as 20-Newsgroups (20NG), Ohsumed, R52 and R8 of
Revised: We follow the setting of Text GCN (Yao et al., 2019) that includes experiments on four widely used benchmark corpora such as 20-Newsgroups (20NG), Ohsumed, R52 and R8 of

Original: Reuters 21578.
Revised: Reuters 21578.

Original: For Text GCN, SGC, and our approach, the embedding size of the ﬁrst convolution layer is 200 and the window size is 20.
Revised: For Text GCN, SGC, and our approach, the embedding size of the ﬁrst convolution layer is 200 and the window size is 20.

Original: We set the learning rate to 0.02, dropout rate to 0.5 and the decay rate to 0.
Revised: We set the learning rate to 0.02, dropout rate to 0.5 and the decay rate to 0.

Original: The 10% of training set is randomly selected for validation.
Revised: The 10% of training set is randomly selected for validation.

Original: Following (Kipf & Welling, 2016), we trained our method and Text GCN for a maximum of 200 epochs using the
Revised: Following (Kipf & Welling, 2016), we trained our method and Text GCN for a maximum of 200 epochs using the

Revised: [Table]

Original: Adam (Kingma & Ba, 2014) optimizer, and we stop training if the validation loss does not decrease for 10 consecutive epochs.
Revised: Adam (Kingma & Ba, 2014) optimizer, and we stop training if the validation loss does not decrease for 10 consecutive epochs.

Original: The text graph was built according to steps detailed in the supplementary material.
Revised: The text graph was built according to steps detailed in the supplementary material.

Original: To convert text classiﬁcation into the node classiﬁcation on graph, there are two relationships considered when forming graphs: (i) the relation between documents and words and (ii) the connection between words.
Revised: To convert text classiﬁcation into the node classiﬁcation on graph, there are two relationships considered when forming graphs: (i) the relation between documents and words and (ii) the connection between words.

Original: For the ﬁrst type of relations, we build edges among word nodes and document nodes based on the word occurrence in documents.
Revised: For the ﬁrst type of relations, we build edges among word nodes and document nodes based on the word occurrence in documents.

Original: The weight of the edge between a document node and a word node is the Term Frequency-Inverse Document Frequency (Rajaraman & Ullman,[Table] 2011) (TF-IDF) of the word in the document applied to build the Docs-words graph.
Revised: The weight of the edge between a document node and a word node is the Term Frequency-Inverse Document Frequency (Rajaraman & Ullman, 2011) (TF-IDF) of the word in the document applied to build the Docs-words graph.

Original: For the second type of relations, we build edges in graph among word co-occurrences across the whole corpus.
Revised: For the second type of relations, we build edges in graph among word co-occurrences across the whole corpus.

Original: To utilize the global word co-occurrence information, we use a ﬁxed-size sliding window on all documents in the corpus to gather co-occurrence statistics.
Revised: To utilize the global word co-occurrence information, we use a ﬁxed-size sliding window on all documents in the corpus to gather co-occurrence statistics.

Original: Point-wise Mutual Information (Church &
Revised: Point-wise Mutual Information (Church &

Original: Hanks, 1990) (PMI), a popular measure for word associations, is used to calculate weights between two word nodes according to the following deﬁnition:
Revised: Hanks, 1990) (PMI), a popular measure for word associations, is used to calculate weights between two word nodes according to the following deﬁnition:

Original: [Equation]
Revised: [Equation]

Original: (14) where p ( i, j ) =
Revised: ) where p ( i, j ) =

Original: W ( i,j ) W , p ( i ) =
Revised: W ( i,j ) W , p ( i ) =

Original: W ( i ) W .
Revised: W ( i ) W .

Original: # W ( i ) is the number of sliding windows in a corpus that contain word i , # W ( i, j ) is the number of sliding windows that contain both word i and word j , and # W is the total number of sliding windows in the corpus.
Revised: # W ( i ) is the number of sliding windows in a corpus that contain word i , # W ( i, j ) is the number of sliding windows that contain both word i and word j , and # W is the total number of sliding windows in the corpus.

Original: A positive PMI value implies a high semantic correlation of words in a corpus, while a negative PMI value indicates little or no semantic correlation in the corpus.
Revised: A positive PMI value implies a high semantic correlation of words in a corpus, while a negative PMI value indicates little or no semantic correlation in the corpus.

Original: Therefore, we only add edges between word pairs with positive
Revised: Therefore, we only add edges between word pairs with positive

Original: PMI values:
Revised: PMI values:

Original: [Equation]
Revised: [Equation]

Original: or
Revised: or

Original: [Equation]

Original: PMI

Original: [Equation]

Original: if i

Original: [Equation]

Original: j are words

Original: [Equation]

Original: PMI

Original: [Equation]

Original: i

Original: [Equation]

Original: j

Original: [Equation]

Original: >

Original: [Equation]

Original: is document

Original: [Equation]

Original: otherwise

Original: [Equation]
Revised: [Equation]

Original: A. T HEORETICAL ANALYSIS
Revised: A. T HEORETICAL ANALYSIS

Original: Below we show that we can reduce oversmoothing compared to SGC while incorporating larger receptive ﬁelds.
Revised: Below we show that we can reduce oversmoothing compared to SGC while incorporating larger receptive ﬁelds.

Original: Our design contains a sum of consecutive diffusion matrices (cid:101) T k , k = 0 , · · · , K .
Revised: Our design contains a sum of consecutive diffusion matrices (cid:101) T k , k = 0 , · · · , K .

Original: As k increases, so does the neighbourhood of each node visited in diffusion (cid:101) T k
Revised: As k increases, so does the neighbourhood of each node visited in diffusion (cid:101) T k

Original: (analogy to random walks).
Revised: (analogy to random walks).

Original: This means that:
Revised: This means that:

Original: Claim I.
Revised: Claim I.

Original: Our ﬁlter, by design, will give the highest weight to the closest neighborhood of a node as neighborhoods N of diffusion steps k = 0 , [Equation] [Equation] obey
Revised: Our ﬁlter, by design, will give the highest weight to the closest neighborhood of a node as neighborhoods N of diffusion steps k = 0 , · · · , K obey: N ( (cid:101) T 0 ) ⊆

Original: [Equation] ) ⊆
Revised: N ( (cid:101) T 1 ) ⊆ · · · ⊆ N ( (cid:101) T K ) ⊆

Original: N ( (cid:101) T ∞ ) .
Revised: N ( (cid:101) T ∞ ) .

Original: That is, smaller neighbourhoods belong to larger neighbourhoods too.
Revised: That is, smaller neighbourhoods belong to larger neighbourhoods too.

Original: To see this clearer, for the q -dimensional Euclidean lattice graph with inﬁnite number of nodes, after t steps of random walk, the estimate of absolute distance the walk moves from the source to its current position is given as:
Revised: To see this clearer, for the q -dimensional Euclidean lattice graph with inﬁnite number of nodes, after t steps of random walk, the estimate of absolute distance the walk moves from the source to its current position is given as:

Original: [Equation]
Revised: [Equation]

Original: (16) where r ( t, q ) is the absolute distance walked from the source to the current point and Γ( · ) is the
Revised: where r ( t, q ) is the absolute distance walked from the source to the current point and Γ( · ) is the

Original: Gamma function.
Revised: Gamma function.

Original: Moreover, if the number of dimensions q → ∞ , we have r ( t, q ) ≤ √ t .
Revised: Moreover, if the number of dimensions q → ∞ , we have r ( t, q ) ≤ √ t .

Original: It is clear then that the receptive ﬁeld associated with the random walk (and thus diffusion at time t ) obeys the monotonically increasing radius r , that is r (0)
Revised: It is clear then that the receptive ﬁeld associated with the random walk (and thus diffusion at time t ) obeys the monotonically increasing radius r , that is r (0)

Original: ≤ r (1) ≤ · · · ≤ r ( K ) ≤ · · · ≤ r ( ∞ ) .
Revised: ≤ r (1) ≤ · · · ≤ r ( K ) ≤ · · · ≤ r ( ∞ ) .

Original: To see that, simply plot √ t (and/or the more complicated expression).
Revised: To see that, simply plot √ t (and/or the more complicated expression).

Original: This proves Claim I for the Euclidean lattice graph.
Revised: This proves Claim I for the Euclidean lattice graph.

Original: That is, for consecutive diffusion steps (cid:101) T k , k = 0 , · · · , K , our receptive ﬁeld grows.
Revised: That is, for consecutive diffusion steps (cid:101) T k , k = 0 , · · · , K , our receptive ﬁeld grows.

Original: Moreover, note that our ﬁlter is realized as the sum of consecutive diffusion steps, that ist (cid:80) tτ =
Revised: Moreover, note that our ﬁlter is realized as the sum of consecutive diffusion steps, that ist (cid:80) tτ =

Original: diff ( s, τ ) where s is the source of walk.
Revised: diff ( s, τ ) where s is the source of walk.

Original: It is easy to see then that even if each walked distance was to contribute the energy proportional with r ( t ) to the summation term, we have:
Revised: It is easy to see then that even if each walked distance was to contribute the energy proportional with r ( t ) to the summation term, we have:

Original: [Equation]
Revised: [Equation]

Original:  where the enumerator is the model of the total energy when aggregating over receptive ﬁelds from size 0 to ∞ in S 2 GC while the denominator is the total energy of SGC (ﬁlter is given by (cid:101) T K , that is by diff ( s, t ) ).
Revised: (17) where the enumerator is the model of the total energy when aggregating over receptive ﬁelds from size 0 to ∞ in S 2 GC while the denominator is the total energy of SGC (ﬁlter is given by (cid:101) T K , that is by diff ( s, t ) ).

Original: Claim II.
Revised: Claim II.

Original: The above proof shows that the above ratio of energies is 0 tells that the energy of inﬁnitedimensional receptive ﬁeld (when t → ∞ ) is not going to dominate the sum energy of our ﬁlter.
Revised: The above proof shows that the above ratio of energies is 0 tells that the energy of inﬁnitedimensional receptive ﬁeld (when t → ∞ ) is not going to dominate the sum energy of our ﬁlter.

Original: Thus, according to this model S 2 GC can incorporate larger receptive ﬁelds without overbearing contributions of smaller receptive ﬁelds compared to SGC as t → ∞ on the Euclidean lattice graph.
Revised: Thus, according to this model S 2 GC can incorporate larger receptive ﬁelds without overbearing contributions of smaller receptive ﬁelds compared to SGC as t → ∞ on the Euclidean lattice graph.

Original: However, in practice, we work with ﬁnite-dimensional non-Euclidean graphs.
Revised: However, in practice, we work with ﬁnite-dimensional non-Euclidean graphs.

Original: Obtaining the absolute distance r ( t ) walked from the source is a difﬁcult topic.
Revised: Obtaining the absolute distance r ( t ) walked from the source is a difﬁcult topic.

Original: Kindly see for instance Eq.
Revised: Kindly see for instance Eq.

Original: 184 in
Revised: 184 in

Original: Masuda et al.
Revised: Masuda et al.

Original: For this reason, below we use a simple approximation.
Revised: For this reason, below we use a simple approximation.

Original: We use Theorem 1 (main paper) as the proxy for the walked radius.
Revised: We use Theorem 1 (main paper) as the proxy for the walked radius.

Original: That is to say the error of convergence to the stationary distribution is indicative of the absolute distance walked from the source/node.
Revised: That is to say the error of convergence to the stationary distribution is indicative of the absolute distance walked from the source/node.

Original: Speciﬁcally, we have:
Revised: Speciﬁcally, we have:

Original: Recall Theorem 1.
Revised: Recall Theorem 1.

Original: That is, let λ 2 denote second largest eigenvalue of transition matrix (cid:101) T
Revised: That is, let λ 2 denote second largest eigenvalue of transition matrix (cid:101) T

Original: = D − 1 A , p ( t ) be the probability distribution vector and π the stationary distribution.
Revised: = D − 1 A , p ( t ) be the probability distribution vector and π the stationary distribution.

Original: If walk starts from the vertex i , p i (0) = 1 , then after t steps for every vertex:
Revised: If walk starts from the vertex i , p i (0) = 1 , then after t steps for every vertex:

Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: Then, the average walked distance r from node i over t steps in a graph with n nodes and connectivity given by the second largest eigenvalue λ 2 , denoted by r ( i, t, n ) is lower-bounded by ¯ r ( i, t, n ) as follows:
Revised: Then, the average walked distance r from node i over t steps in a graph with n nodes and connectivity given by the second largest eigenvalue λ 2 , denoted by r ( i, t, n ) is lower-bounded by ¯ r ( i, t, n ) as follows:

Original: [Equation]
Revised: [Equation]

Original: where n is the number of nodes, t is the number of diffusion steps (think (cid:101) T k ), d i and d j are degrees of nodes i and j ,
Revised: where n is the number of nodes, t is the number of diffusion steps (think (cid:101) T k ), d i and d j are degrees of nodes i and j ,

Original: λ 2 being the second largest eigenvalue intuitively denotes the graph connectivity (large λ 2 ≤ 1 indicates low connectivity while low λ 2 indicates high connectivity in graph), and | E | is the total number of edges in the graph.
Revised: λ 2 being the second largest eigenvalue intuitively denotes the graph connectivity (large λ 2 ≤ 1 indicates low connectivity while low λ 2 indicates high connectivity in graph), and | E | is the total number of edges in the graph.

Original: While the above approximations may be loose for very small/large t , the important property to note is that r
Revised: While the above approximations may be loose for very small/large t , the important property to note is that r

Original: ( i, 0 , n ) ≤ r ( i, 1 , n ) ≤ · · · ≤ r ( i, t, n ) which indicates that our ﬁlter indeed realises the sum over increasingly larger receptive ﬁelds.
Revised: ( i, 0 , n ) ≤ r ( i, 1 , n ) ≤ · · · ≤ r ( i, t, n ) which indicates that our ﬁlter indeed realises the sum over increasingly larger receptive ﬁelds.

Original: As smaller receptive ﬁelds are a subset of larger receptive ﬁelds given node i , that is N ( (cid:101) T 0 ) 
Revised: As smaller receptive ﬁelds are a subset of larger receptive ﬁelds given node i , that is N ( (cid:101) T 0 ) ⊆

Original: [Equation] T 1 ) ⊆ [Equation] · · ⊆ N ( (cid:101) T K ) ⊆
Revised: N ( (cid:101) T 1 ) ⊆ · · · ⊆ N ( (cid:101) T K ) ⊆

Original: N ( (cid:101) T ∞ ) , this proves our Claim I.
Revised: N ( (cid:101) T ∞ ) , this proves our Claim I.

Original: To prove Claim II for general graphs, we have:
Revised: To prove Claim II for general graphs, we have:

Original: [Equation]
Revised: [Equation]

Original: Similar ﬁndings are highlighted by carefully considering the meaning of so-called Cheeger constant introduced in Section A.5.
Revised: Similar ﬁndings are highlighted by carefully considering the meaning of so-called Cheeger constant introduced in Section A.5.

Original: More on spectral analysis of ﬁlters in GCNs can be found in the studies of Li et al.
Revised: More on spectral analysis of ﬁlters in GCNs can be found in the studies of Li et al.

Original: (2018a)
Revised: (2018a)

Original: and
Revised: and

Original: Li et al.
Revised: Li et al.

Original: (2018b).
Revised: (2018b).

Original: A. G RAPH PARTITIONING
Revised: A. G RAPH PARTITIONING

Original: Below we introduce the deﬁnitions of expansion and k -way Cheeger constant.
Revised: Below we introduce the deﬁnitions of expansion and k -way Cheeger constant.

Original: Deﬁnition A.1.
Revised: Deﬁnition A.1.

Original: Expansion:
Revised: Expansion:

Original: For a node subset S ⊆ V, φ ( S) =
Revised: For a node subset S ⊆ V, φ [Equation] S

Original: [Equation]
Revised: [Equation]

Original: where E ( S ) is the set of edges with one node in S and vol ( S ) is the sum of degree of nodes in set S.
Revised: where E ( S ) is the set of edges with one node in S and vol ( S ) is the sum of degree of nodes in set S.

Original: Deﬁnition A.2.
Revised: Deﬁnition A.2.

Original: The k -way Cheeger constant is given as: ρ G ( k ) =
Revised: The k -way Cheeger constant is given as: ρ G ( k ) =

Original: min S 1 ,S 2 , ··· ,S k max { φ ( S i ) : i = { 1 , · · · , k }} where the minimum is over all collections of k non-empty disjoint subsets
Revised: min S 1 ,S 2 , ··· ,S k max { φ ( S i ) : i = { 1 , · · · , k }} where the minimum is over all collections of k non-empty disjoint subsets

Original: S 1 , S 2 , · · · , S k ⊆ V .
Revised: S 1 , S 2 , · · · , S k ⊆ V .

Original: According to the deﬁnitions, the expansion in Def.
Revised: According to the deﬁnitions, the expansion in Def.

Original: A.1 describes the effect of graph partitioning according to subset S while the k -way Cheeger constant reﬂects the effect of the graph partitioning into k parts–the smaller the value the better the partitioning is.
Revised: A.1 describes the effect of graph partitioning according to subset S while the k -way Cheeger constant reﬂects the effect of the graph partitioning into k parts–the smaller the value the better the partitioning is.

Original: Higher-order Cheeger’s inequality (Bandeira et al., 2013; Lee et al., 2014) bridges the gap between the network spectral analysis and graph partitioning by controlling the bounds of k -way Cheeger constant: 
Revised: Higher-order Cheeger’s inequality (Bandeira et al., 2013; Lee et al., 2014) bridges the gap between the network spectral analysis and graph partitioning by controlling the bounds of k -way Cheeger constant: [Equation]

Original: [Equation]
Revised: [Equation]

Original: (21) where λ k is the k-th eigenvalue of the normalized Laplacian matrix and 0 = λ 1 ≤ λ 2 ≤ · · · ≤ λ n .
Revised: where λ k is the k-th eigenvalue of the normalized Laplacian matrix and 0 = λ 1 ≤ λ 2 ≤ · · · ≤ λ n .

Original: From inequality 21, we can conclude that small (large) eigenvalues control global clustering (local smoothing) effect of the graph partitioned into a few large parts (many small parts).
Revised: From inequality 21, we can conclude that small (large) eigenvalues control global clustering (local smoothing) effect of the graph partitioned into a few large parts (many small parts).