| Abstrakt: |
In graph signal processing, filters arise from polynomials in shift matrices that respect the graph structure, such as the graph adjacency matrix or the graph Laplacian matrix. Hence, filter design for graph signal processing benefits from knowledge of the spectral decomposition of these matrices. Often, stochastic influences affect the network structure and, consequently, the shift matrix empirical spectral distribution. Although the joint distribution of the shift matrix eigenvalues is typically inaccessible, deterministic functions that asymptotically approximate the matrix empirical spectral distribution can be found for suitable random graph models using tools from random matrix theory. We employ this information regarding the density of eigenvalues to develop criteria for optimal graph filter design. In particular, we consider filter design for distributed average consensus and related problems, leading to improvements in short-term error minimization or in asymptotic convergence rate. [ABSTRACT FROM AUTHOR] |
