Using GSPBox, create a 60-node random sensor network and define a signal f on the graph as

where c is a constant and d (i, j) is the distance between nodes

i and j (can be found using Dijkstra’s shortest path algorithm).

(a) Plot the graph.

(b) For c = 0

.05, plot the graph signal in the vertex domain using color coding as well as

bar representation. Compute the GFT coefficients, and plot the signal in the frequency

domain. Comment on the frequency content of the signal.

(c) Plot the graph signals for c = 0.5, c = 1, and c = 2 in the vertex as well as frequency

domains. Comment on the smoothness of graph signals as the value of

c increases.