Efficient Directed Graph Sampling via Gershgorin Disc Alignment

Yuejiang Li, Hong Vicky Zhao, Gene Cheung

Graph sampling is the problem of choosing a node subset via sampling matrix $\mathbf{H}\in \{0,1{\}}^{K\times N}$ to collect samples $\mathbf{y} = \mathbf{H} \mathbf{x} \in \mathbb…