Моделирование графов ближайших соседей для оценки вероятности независимости выборочных данных;Modeling of nearest neighbor graphs to estimate the probability of independen

DOI10.20948/mm-2023-07-05OpenAlexW4381743091MaRDI QIDQ6165675

A. A. Kislitsyn

Publication date: 1 August 2023

Published in: Математическое моделирование (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mm4479

zbMATH Keywords

connected graphnearest neighbor graphdistribution by number of fragments

Mathematics Subject Classification ID

Statistics (62-XX) Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disorder indicator for nonstationary stochastic processes
• Discussion about properties of first nearest neighbor graphs
• Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
• A Note on Distance-Weighted k-Nearest Neighbor Rules
• The problem of the twenty-five spheres
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Моделирование графов ближайших соседей для оценки вероятности независимости выборочных данных;Modeling of nearest neighbor graphs to estimate the probability of independen