Fixed Sparse Graphs
k-nearest-neighbor graphs use O(nk) edges and can reduce pairwise evaluations by Theta(n/k). Fixed sparse graphs change the measurement target by intentionally excluding non-edge pairs. A fixed sparse graph can hide behavioral diversity th…
1 sources - 5 claims
k-nearest-neighbor graphs use O(nk) edges and can reduce pairwise evaluations by Theta(n/k). Fixed sparse graphs change the measurement target by intentionally excluding non-edge pairs. A fixed sparse graph can hide behavioral diversity that occurs on non-edges. Fixed-graph Graph-SND should not be interpreted as full-system diversity unless the graph is justified as a proxy. Communication graphs can align diversity measurement with interaction structure inherited from policy message passing.