Escolar Documentos
Profissional Documentos
Cultura Documentos
Matthew Begue
Primary Sources
[2] David I Shuman, Benjamin Ricaud, and Pierre Vandergheynst,
Vertex-frequency analysis on graphs, preprint, (2013).
[3] David K Hammond, Pierre Vandergheynst, and Remi Gribonval
Wavelets on graphs via spectral graph theory, Applied and
Computational Harmonic Analysis 30 (2011) no. 2, 129-150.
Secondary Sources
[1] Fan RK Chung, Spectral Graph Theory, vol. 92, American
Mathematical Soc., 1997.
Why study graphs?
f (x + h) 2f (x) + f (x h)
f 00 (x) = lim .
h0 h2
f (x + h) 2f (x) + f (x h)
f 00 (x) = lim .
h0 h2
L=DA
0 = 0 < 1 2 N1 .
49 49 49
48 48 48
47 47 47
46 46 46
45 45 45
44 44 44
43 43 43
98 97 96 95 94 93 92 91 90 89 98 97 96 95 94 93 92 91 90 89 98 97 96 95 94 93 92 91 90 89
49 49 49
48 48 48
47 47 47
46 46 46
45 45 45
44 44 44
43 43 43
98 97 96 95 94 93 92 91 90 89 98 97 96 95 94 93 92 91 90 89 98 97 96 95 94 93 92 91 90 89
1 1 1
0 0 0
1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1 1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1 1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1
1 1 1
0 0 0
1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1 1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1 1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1
0.015 0.01
0.005
0.01
0.005
0
0.005
0
0 0.005
0.005
0.005
0.01
0.01
0.01
0.015 0.015
0.015
0 0 0
Definition
The graph Fourier transform is defined as
N
X
f (l ) = hf , l i = f (n)l (n).
n=1
hf , gi = hf , gi.
Proof.
This can be seen easily using the matrix notation since is an
orthonormal matrix. That is,
hf , gi = f g = ( f ) g = f g = f g = hf , gi.
Definition
For any k = 0, 1, ..., N 1 the graph modulation operator Mk , is
defined as
(Mk f )(n) = Nf (n)k (n).
M f () = f ( ).
d
The graph modulation does not exhibit this property due to the
discrete nature of the spectral domain.
Example - Movie
G =SG6
f (l ) = 2 (l) = f = 2 .
0.02
0.015
0.01
0.005
0.005
0.01
2
1.5 1
0.5
1
0
0.5
0.5
0 1
Example - Movie
G =Minnesota
f (l ) = 2 (l) = f = 2 .
50
49
48
47
46
45
44
43
98 97 96 95 94 93 92 91 90 89
Graph Convolution - Motivation and Definition
g)() = f ()g(),
(fd
Definition
For f , g : V R, we define the graph convolution of f and g as
N1
X
f g(n) = f (l )g(l )l (n).
l=0
Properties of graph convolution
N1
X
f g(n) = f (l )g(l )l (n).
l=0
Proposition
1.5
1.8
1.6
1
1.4
1.2
0.5
1
0.8
4
2 0.6
0
0 0.4
2
0.2
4
0.5
0 1 2 3 4 5 6 7 0
1 0.8 0.6 0.4 0.2 0 0.2 0.4 0.6 0.8 1
Graph Translation
Definition
For any f : V R the graph translation operator, Ti , is defined to be
N1
X
(Ti f )(n) = N(f i )(n) = N f (l )l (i)l (n).
l=0
Example - Movie
G =Minnesota
f = 11
1
1
0.8
0.8
0.6
0.4
0.6
0.2
0.4
0
50
0.2
49
0
48
0.2
47
0.4
46
0.6
45
0.8
44
1
43 0 1 2 3 4 5 6
98 97 96 95 94 93 92 91 90 89
Example - Movie
G =Minnesota
f (l ) = e5l
0.12
0.05
0.1
0
0.05 0.08
0.1
50
0.06
49
0.04
48
47
0.02
46
45
0
44
90 89
92 91
94 93 0.02
43 96 95 0 1 2 3 4 5 6 7
98 97
Example - Movie
G =SG6
f (l ) = e5l
0.8
0.1
0.6
0.08
0.06 0.4
0.04
0.02 0.2
0
0
0.02
0.04
0.2
0.06
0.08
0.4
0.1
2
0.6
1.5 1
0.5
1 0.8
0
0.5
0.5
1
0 1 0 1 2 3 4 5 6
Example - Movie
G =Minnesota
f 1
10 1
0 0.8
5
0.6
50
0.4
49
0.2
48
47
0.2
46
0.4
45
0.6
44 0.8
1
43 92 91 90 89 0 1 2 3 4 5 6
96 95 94 93
98 97
Properties of Translation operator
Proposition
For any f , g : V R and i, j {1, 2, ..., N} then
1 Ti (f g) = (Ti f ) g = f (Ti g).
2 Ti Tj f = Tj Ti f .
Properties of Translation operator
Corollary
Ti f (n) = Tn f (i).
Corollary
Given a graph, G, with real valued eigenvectors. Let be a
multiindex, i.e. = (1 , 2 , ..., K ) where j {1, ..., N} for 1 j K
and let 0 {1, ..., N}. We let T denote the composition
T1 T2 TK . Then for any f : V R, we have
T f (0 ) = T f (0 ),
Theorem
If g(0) 6= 0, then {gi,k }i=1,2,...,N;k =0,1,...,N1 is a frame. That is for all
f : V R,
N N1
2 2
X X
A kf k`2 |hf , gi,k i|2 B kf k`2
i=1 k=0
where
2 2
A := min {N kTn gk`2 }, B := max {N kTn gk`2 }
n=1,2,...,N n=1,2,...,N
Theorem
Provided the window, g, has non-zero mean, i.e. g(0) 6= 0, then for
any f : V R,
N N1
1 X X
f (n) = 2
Sf (i, k )gi,k (n).
N kTn gk`2 i=1 k =0