Random-Walk laplacian for frequency analysis in periodic graphs
Cita com:
hdl:2117/350117
Tipus de documentArticle
Data publicació2021-02-11
EditorMultidisciplinary Digital Publishing Institute (MDPI)
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement 3.0 Espanya
ProjecteAVANCES EN CODIFICACION Y PROCESADO DE SEÑAL PARA LA SOCIEDAD DIGITAL (AEI-PID2019-104958RB-C41)
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.
CitacióBoukrab, R.; Pagès-Zamora, A. Random-Walk laplacian for frequency analysis in periodic graphs. "Sensors", 11 Febrer 2021, vol. 21, núm. 4, p. 1-13.
ISSN1424-8220
Versió de l'editorhttps://www.mdpi.com/1424-8220/21/4/1275
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
sensors-21-01275.pdf | 2,358Mb | Visualitza/Obre | ||
sensors-21-01275-v2.pdf | Full text OA | 2,361Mb | Visualitza/Obre |