Name
Abstract | ||
|---|---|---|
This paper presents the benefits of using the random-walk normalized Laplacian matrix as a graph-shift operator and defines the frequencies of a graph by the eigenvalues of this matrix. A criterion to order these frequencies is proposed based on the Euclidean distance between a graph signal and its shifted version with the transition matrix as shift operator. Further, the frequencies of a periodic graph built through the repeated concatenation of a basic graph are studied. We show that when a graph is replicated, the graph frequency domain is interpolated by an upsampling factor equal to the number of replicas of the basic graph, similarly to the effect of zero-padding in digital signal processing. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.3390/s21041275 | SENSORS |
Keywords | DocType | Volume |
graph Fourier transform, frequency ordering, random-walk Laplacian, periodic graph | Journal | 21 |
Issue | ISSN | Citations |
4 | 1424-8220 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rachid Boukrab | 1 | 0 | 0.34 |
| Alba Pagès-Zamora | 2 | 32 | 3.69 |