Characteristics and analysis of nearest neighbor graphs generated by random matrices

DOI10.20948/MM-2024-06-01MaRDI QIDQ7006101zbMATH OpenFDO

Authors A. A. Kislitsyn

Publication date 31 March 2025

Published in Matematicheskoe Modelirovanie (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20948/MM-2024-06-01

zbMATH Keywords

criterion of random variables independencedecimal representation of \(\pi\) numbernearest neighbor graphrandom matrixstructures

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52)

Cites work

• Box integrals
• Discussion about properties of first nearest neighbor graphs
• scientific article; zbMATH DE number 3849168 (Why is no real title available?)
• Mathematical statistics. Textbook
• On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
• Statistical analysis of graph structures in random variable networks
• The elements of statistical learning. Data mining, inference, and prediction
• Моделирование графов ближайших соседей для оценки вероятности независимости выборочных данных;Modeling of nearest neighbor graphs to estimate the probability of independen

This page was built for publication: Characteristics and analysis of nearest neighbor graphs generated by random matrices

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