Uniformly Weighted Graphical Designs
The paper gives a constructive way to select a uniform subset of graph vertices whose empirical average matches the full-graph average for every function in a prescribed collection of low-Laplacian-frequency eigenspaces. The transferable…