Movement Stability of D-Optimal Sensor Placement Under Projector Perturbations
Abstract
In time-varying D-optimal subset selection, the number of replaced coordinates does not measure physical displacement: when the optimal selection for a set of mobile sensors changes, a single sensor may have to cross the entire graph. We therefore measure movement by a bottleneck matching distance on a fixed mobility graph, and define the distance margin at radius P as the smallest old-objective loss among configurations farther than P from the current maximizer. Our main result shows that if the projector drift is small and the distance margin at a chosen radius exceeds an explicit threshold, then every maximizer of the new objective lies within that radius, without tie-breaking rules or uniform conditioning assumptions over subsets. Moreover, we show that separation information of this kind is genuinely needed: a weighted-path construction shows that, at a fixed baseline eigengap, an arbitrarily small perturbation can move an optimal sensor from one end of the graph to the other, so no bound depending only on perturbation size and eigengap can vanish with the perturbation. We also give a finite certificate, conditions under which local and Voronoi restrictions retain a global optimum, and oversampled and regularized extensions, and we identify the learned dictionary criteria to which the results apply.
Related
- Property (R) with its stability for analytic functional system and under compact perturbations
- Perturbations of Kerr-Newman black holes: separation and mode stability
- A note on the stability of Arens products under small perturbations of multiplication
- Existence and Asymptotic Stability of Traveling Waves of Two-species Lotka-Volterra Competition-Diffusion Systems via Geometric Singular Perturbations
- Nonlinear Stability of Linearly Expanding Goldreich-Weber Solutions for the Navier-Stokes-Poisson System with Degenerate Viscosity Under Radial Perturbations
BibTeX
@misc{yin2026movement,
title = {{Movement Stability of D-Optimal Sensor Placement Under Projector Perturbations}},
author = {Isabella Yin and Laura P. Schaposnik},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.08152},
eprint = {2610.08152},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.08152},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Movement Stability of D-Optimal Sensor Placement Under Projector Perturbations
AU - Isabella Yin
AU - Laura P. Schaposnik
PY - 2026
DA - 2026/10/06
PB - arXiv
DO - 10.48550/arxiv.2610.08152
UR - https://arxiv.org/abs/2610.08152
AB - In time-varying D-optimal subset selection, the number of replaced coordinates does not measure physical displacement: when the optimal selection for a set of mobile sensors changes, a single sensor may have to cross the entire graph. We therefore measure movement by a bottleneck matching distance on a fixed mobility graph, and define the distance margin at radius P as the smallest old-objective loss among configurations farther than P from the current maximizer. Our main result shows that if the projector drift is small and the distance margin at a chosen radius exceeds an explicit threshold, then every maximizer of the new objective lies within that radius, without tie-breaking rules or uniform conditioning assumptions over subsets. Moreover, we show that separation information of this kind is genuinely needed: a weighted-path construction shows that, at a fixed baseline eigengap, an arbitrarily small perturbation can move an optimal sensor from one end of the graph to the other, so no bound depending only on perturbation size and eigengap can vanish with the perturbation. We also give a finite certificate, conditions under which local and Voronoi restrictions retain a global optimum, and oversampled and regularized extensions, and we identify the learned dictionary criteria to which the results apply.
ER -