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

DOI10.20948/MM-2023-07-05MaRDI QIDQ6165675zbMATH OpenOpenAlexFDO

Authors 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 graphdistribution by number of fragmentsnearest neighbor graph

Mathematics Subject Classification ID

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

Cites work

• A Note on Distance-Weighted k-Nearest Neighbor Rules
• Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
• Discussion about properties of first nearest neighbor graphs
• Disorder indicator for nonstationary stochastic processes
• scientific article; zbMATH DE number 3984189 (Why is no real title available?)
• scientific article; zbMATH DE number 3383425 (Why is no real title available?)
• scientific article; zbMATH DE number 3088583 (Why is no real title available?)
• 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
• The problem of the twenty-five spheres

Cited in

(4)

• Estimating network edge probabilities by neighbourhood smoothing
• On spectral portraits of incidence matrices of nearest neighbor graphs
• Characteristics and analysis of nearest neighbor graphs generated by random matrices
• Random nearest neighbor graphs: benchmarking and statistical analysis

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

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