arXiv (All)
open access
Finite and Dynamic Stability Horizons for Nearest-Neighbor Future Structures
Nearest-neighbor graphs are discrete objects whose membership may change under small perturbations of the underlying coordinates. We establish an explicit stability guarantee for finite labeled configurations in an arbitrary metric space. If the gap between the kth and (k+1)st distances is positive,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Constrained Nonconvex Stochastic Optimization with One Projection#1119172
- Boolean building set arrangements#1036263
- Resolvable 3-star designs#955113
- Distinguishing adjacent vertices by ordering edges#999514
- Geometric Evaluation of Multidimensional Embeddings via Convex Hulls and Ramsey-3,3 Triples#87072
Record · ID 1061411
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive