lipschitz graph convolutions of graph signals converge to lipschitz graphon filters

[[concept]]
Theorem

Let (Gn,Xn)(W,X).

Let H(Gn)=k=0K1hk(Ann)k be a sequence of graph convolution that share coefficients with graphon convolution TH=k=0K1hkTW(k) where h(λ) is a Lipschitz graphon filter. Then

(Gn,Yn)(W,Y)

Where Yn and Y are the graph and graphon convolution outputs respectively.

Proof

Note

We want to show the outputs on the graph convolutions converge in the "induced graphon signal" sense to the outputs of the graphon convolution

WLOG, we assume that |h(λ)|1λ[1,1]. We have

Y=jZ{0}h(λj)X^jφj and Yn=jZ{0}h(λj(n))[X^n]jφj(n)
note on notation

λj,Xj,φj are the eigenvalues, graphon signal, and eigenfunctions of the graphon respectively. λj(n),[X^n]j,φj(n) are the eigenvalues, graph signals, and eigenvectors of the graphs in the sequence of convergent graphs and convergent graph signals.

Define an partitioning index set C such that

{jC={i s.t. |λi|c}jC={i s.t. |λi|<c} where c=1|h0|L(2||X||ϵ1+1)

Where we fix some ϵ>0, h0=h(0), and L is the Lipschitz constant. We can choose ϵ such that c=kk[1,1]. Further, note that this creates a set of bandlimited components (C) and non-bandlimited components (Cc) of the signal.

Then, by the triangle inequality, we have

||YYn||=||jZ{0}h(λj)X^jφjjZ{0}h(λj(n))[X^n]jφj(n)||||jCh(λjX^jφj)jCh(λj(n))[X^n]jφj(n)||(1)+||jCh(λjX^jφj)jCh(λj(n))[X^n]jφj(n)||(2)

And we can bound (1) and (2) individually.

It is very easy to bound (1), since this is equivalent to filter applications to a bandlimited X with bandwith c. Thus, (1) vanishes as a direct applications of the previous result (bandlimited convergent graph signals converge in the fourier domain) to this expression.

For (2), we note that

h0Lch(λj)h0+LcjC

Then we can write

(2)=||jCh(λjX^jφj)jCh(λj(n))[X^n]jφj(n)||(h0+Lc)||jCh(λjX^jφj)jCh(λj(n))[X^n]jφj(n)||h0||jCX^jφj[X^n]jφj(n)||(3)+Lc||jCX^jφj||()Lc||X||+Lc||jC[X^n]jφj(n)||(4)

We can see () follows since jCX^jφj is a portion of graphon signal X=jZ{0}X^jφj. And so, we can upper bound the norm of the portion of the signal by the norm of the entire signal.

Now, we need to bound (3) and (4).

Note that we can write

()jC[X^n]jφj(n)=XnjC[X^n]jφj(n)

We can do this because the φ form an orthonormal basis for both the graph and the graphon (see the appropriate spectral theorem).

For (3), by writing both the induced graphon signal and the limiting graphon signal in terms of the identity (), we can get

||jCX^jφj[X^n]jφj(n)||=||(XjCX^jφj)(XnjC[X^n]jφj(n))||||XXn||XnX+||jCX^jφj[X^n]jφj(n)||converges (bandlimited signal)<ϵ

Where ϵ is the same one we fixed above. Since both RHS terms converge (the first is from our initial conditions, the second one is again a direct application of bandlimited convergence), we are done for (3).

Finally, for (4),

||jC[X^n]jφj(n)||=||XnjC[X^n]jφj(n)+XX||||XnX||XnX+||jC[X^n]jφj(n)X^jφj||converges (bandlimited)+||jCX^jφj||||X||<ϵ+||X||

Thus we get that

(2)=||jCh(λjX^jφj)jCh(λj(n))[X^n]jφj(n)||Lc||X||+h0ϵ+Lc(ϵ+||X||)<ϵ~

for all n>Nϵ

Note

It was difficult to show convergence for the GFT for spectral components associated with eigenvalues close to 0 (see conjecture 1 from Lecture 17). This is why we showed instead that bandlimited convergent graph signals converge in the fourier domain.

Here, the same thing happens because graphon shift operator eigenvalues
accumulate at 0. The Lipschitz continuity addresses this by ensuring all spectral components near 0 are amplified in an increasingly "similar" way. We can see this by looking at how we defined c in the proof:

c=1|h0|L(2||X||ϵ1+1)
  • If we fix c, in order to have ϵ0, we need progressively smaller Lipschitz constant L. ie, we need flatter and flatter functions
  • If we want c to get smaller (ie, we want the region where the spectral components cannot be discriminated to get smaller), we need a larger L.
see also

Review

#flashcards/math/dsg

{lipschitz graph convolutions} of graph signals converge to {lipschitz graphon filters}

Review

For the convergence of Lipschitz graph convolutions to Lipschitz graphon convolutions, we define

c=1|h0|L(2||X||ϵ1+1)

Where ||X|| and |h0| are fixed.

  • If we fix c, in order to have ϵ0, we need {ah||progressively smaller Lipschitz constant L}. ie, we need {ah||flatter and flatter functions}
  • If we want c to get smaller (ie, we want {ha||a smaller indiscriminable region}), we need {==ha||a larger L (more variation in the function) ==}

Mentions

Mentions

Created 2025-04-15 Last Modified 2025-06-03