We study solution sensitivity for nonlinear programs (NLPs) whose structures are induced by graphs. These NLPs arise in many applications such as dynamic optimization, stochastic optimization with partial differential equations, and network optimization. show that a given pair of nodes, the primal-dual at one node against data perturbation other decays exponentially respect to distance between ...