Cargando…
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...
Autores principales: | Boukrab, Rachid, Pagès-Zamora, Alba |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7916899/ https://www.ncbi.nlm.nih.gov/pubmed/33670095 http://dx.doi.org/10.3390/s21041275 |
Ejemplares similares
-
Directed network Laplacians and random graph models
por: Gong, Xue, et al.
Publicado: (2021) -
Laplacian Estrada and Normalized Laplacian Estrada Indices of Evolving Graphs
por: Shang, Yilun
Publicado: (2015) -
On the Laplacian spectral radii of Halin graphs
por: Jia, Huicai, et al.
Publicado: (2017) -
Rates of convergence for regression with the graph poly-Laplacian
por: Trillos, Nicolás García, et al.
Publicado: (2023) -
Laplacian mixture modeling for network analysis and unsupervised learning on graphs
por: Korenblum, Daniel
Publicado: (2018)