Eigen-Decomposition-Free Directed Graph Sampling via Gershgorin Disc Alignment
Graph sampling is the problem of choosing a node subset via sampling matrix H ∈ {0, 1} <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K×N</sup> to collect samples y = Hx ∈ℝ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.…