Recercat. Dipósit de la Recerca de Catalunya
Publicación
Artículo científico (JournalArticle)
Random-Walk laplacian for frequency analysis in periodic graphs
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., This work has been funded by the Agencia Estatal de Investigación, Ministerio de Ciencia,
Innovación y Universidades of the Spanish Government and ERDF funds (PID2019-104958RB-C41,
RED2018-102668-T); and by the Catalan Government-Secretaria d'Universitats i Recerca, Departament
d'Empresa i Coneixement, Generalitat de Catalunya, AGAUR (2020 FI_B 00495, 2017 SGR 578)., Peer Reviewed, Postprint (published version)