Evolving Distributions Under Local Motion
<|reference_start|>Evolving Distributions Under Local Motion: Geometric data sets arising in modern applications are often very large and change dynamically over time. A popular framework for dealing with such data sets is the evolving data framework, where a discrete structure continuously varies over time due to the unseen actions of an evolver, which makes small changes to the data. An algorithm probes the current state through an oracle, and the objective is to maintain a hypothesis of the data set's current state that is close to its actual state at all times. In this paper, we apply this framework to maintaining a set of $n$ point objects in motion in $d$-dimensional Euclidean space. To model the uncertainty in the object locations, both the ground truth and hypothesis are based on spatial probability distributions, and the distance between them is measured by the Kullback-Leibler divergence (relative entropy). We introduce a simple and intuitive motion model where with each time step, the distance that any object can move is a fraction of the distance to its nearest neighbor. We present an algorithm that, in steady state, guarantees a distance of $O(n)$ between the true and hypothesized placements. We also show that for any algorithm in this model, there is an evolver that can generate a distance of $\Omega(n)$, implying that our algorithm is asymptotically optimal.<|reference_end|>
@article{acharya2024evolving,
    title={Evolving Distributions Under Local Motion},
    author={Aditya Acharya, David M. Mount},
    journal={arXiv preprint arXiv:2409.11779},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.11779},
    primaryClass={cs.CG}
}