Dynamic Sampling empty graph(V,☑) G=V,E) update dynamic sampling algorithm: X0)~⊕，b, Xu O(|update|)dynamic sampling (E)static samplinge v bv Ae G = (V, E) Dynamic Sampling update dynamic sampling algorithm: X ∼ μ dynamic sampling static sampling O˜(|������|) ⟹ O˜(|E|) empty graph (V, ∅) X(0) ∼ ⊕v bv