We describe reversible adaptive trees, a class of stochastic algorithms modified from the formerly described adaptive trees. They evolve in time a finite subset of an ambient Euclidean space of any dimension, starting from a seed point and, accreting points to the evolving set, they grow branches towards a target set which can depend on time. In contrast with plain adaptive trees, which were formerly proven to have strong convergence properties to a static target, the points of reversible adapti…
Read moreWe describe reversible adaptive trees, a class of stochastic algorithms modified from the formerly described adaptive trees. They evolve in time a finite subset of an ambient Euclidean space of any dimension, starting from a seed point and, accreting points to the evolving set, they grow branches towards a target set which can depend on time. In contrast with plain adaptive trees, which were formerly proven to have strong convergence properties to a static target, the points of reversible adaptive trees are removed from the tree when they have not been used recently enough in a path from the root to an accreted point. This, together with a straightening process performed on the branches, permits the tree to follow some moving targets and still remain adapted to it. We then discuss in what way one can see such reversible trees as a model for a qualitative property of resilience, which leads us to discuss qualitative modeling.
