Is the Nearest Neighbor Distribution Enough to Describe the Statistical Behavior of a Domain System?

Diego Luis GonzálezGabriel Téllez2026-03-222026-03-22200910.1007/978-3-540-77074-9_30https://doi.org/10.1007/978-3-540-77074-9_30https://andeanlibrary.org/handle/123456789/81697Citaciones: 1enk-nearest neighbors algorithmNearest neighbor searchSimple (philosophy)Distribution (mathematics)SimilitudeDomain (mathematical analysis)Computer scienceNearest neighbourInterval (graph theory)Statistical physicsIs the Nearest Neighbor Distribution Enough to Describe the Statistical Behavior of a Domain System?book-chapter