Random nearest neighbor graphs: benchmarking and statistical analysis

DOI10.1134/S1995080225612184MaRDI QIDQ7307690zbMATH OpenFDO

Authors A. A. Kislitsyn

Publication date 31 July 2026

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1995080225612184

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Applications of statistics (62P99)

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Random graphs, geometry and asymptotic structure
• Random Plane Networks
• Исследование статистик графов ближайших соседей
• Моделирование графов ближайших соседей для оценки вероятности независимости выборочных данных;Modeling of nearest neighbor graphs to estimate the probability of independen

This page was built for publication: Random nearest neighbor graphs: benchmarking and statistical analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307690)