# Estimating Centrality Blindly from Low-pass Filtered Graph Signals

arXiv: https://arxiv.org/abs/1910.13137 · HTML: https://mlsanity.com/paper/1910.13137/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 29 Oct 2019.

## Built on by (most cited first, 2 of 2)

- [Learning Graph Filters for Structure-Function Coupling based Hub Node Identification](https://mlsanity.com/paper/2410.17410/) (2024)
- [Blind Extraction of Equitable Partitions from Graph Signals](https://mlsanity.com/paper/2203.05407/) (2022)

## Abstract (arXiv)

This paper considers blind methods for centrality estimation from graph signals. We model graph signals as the outcome of an unknown low-pass graph filter excited with influences governed by a sparse sub-graph. This model is compatible with a number of data generation process on graphs, including stock data and opinion dynamics. Based on the said graph signal model, we first prove that the folklore heuristics based on PCA of data covariance matrix may fail when the graph filter is not sufficiently low-pass. To remedy, we propose a robust blind centrality estimation method which substantially improves the centrality estimation performance. Numerical results on synthetic and real data support our findings.