Skip to main content
Log in

Discussion about Properties of First Nearest Neighbor Graphs

  • Published:
Lobachevskii Journal of Mathematics Aims and scope Submit manuscript

Abstract

In this study we present a benchmark of statistical distributions of the first nearest neighbors in random graphs. We consider distribution of such graphs by the number of disconnected fragments, fragments by the number of involved nodes, and nodes by their degrees. The statements about the asymptotic properties of these distributions for graphs of large dimension are proved. The problem of determining the probability of realization of a certain structure of the first nearest neighbors graph depending on the distribution function of distances between the elements of the studied set is considered. It is shown that, up to isomorphism, the graph of the first nearest neighbors does not depend on the distance distribution. This fact makes it possible to conduct numerical experiments on the construction of basic statistics based on a uniform distribution of distances and obtain tabulated data as a result of numerical modeling. A study has been conducted on the conditional extremum of the probability of realizing the distribution of graph vertices by degrees, which allows us to estimate the proportion of randomness for a particular structure resulting from clustering elements of a certain set by the nearest neighbor method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

REFERENCES

  1. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning (Springer, New York, 2001).

  2. G.H. Chen and D. Shah, “Explaining the success of nearest neighbor methods in prediction,’’ Found. Trends Mach. Learn. 10, 337–588 (2018).

  3. G. L. Miller, S. Teng,W. Thurston, and S. A. Vavasis, ‘‘Separators for sphere-packings and nearest neighbor graphs,’’ J. ACM 44, 1–29 (1997).

  4. D. Eppstein, M. Paterson, and F. Yao, “On nearest-neighbor graphs,’’ Discrete Comput. Geom. 17, 263 (1992).

  5. D. Baranchuk, D. Persiyanov, A. Sinitsin, and A. Babenko, ‘‘Learning to routein similarity graphs,’’ in Proceedings of the International Conference on Machine Learning (2019), pp. 475–484.

  6. P. Erdos and A. Renyi, “On random graphs,” Publ. Math. Debrecen 6, 290–297 (1959).

  7. V. F. Kolkin, Random Graphs (Fizmatlit, Moscow, 2004) [in Russian].

  8. B. Bollobas, Random Graphs (Cambridge Univ. Press, UK, 2001).

  9. S. Janson, T. Luczak, and A. Rucinski, Random Graphs (Wiley, New York, 2000).

  10. A. M. Raygorodski, “Simulation of random graphs and their application,’’ Tr. MIFI 2 (4), 130–140 (2010).

  11. A. M. Raygorodski, Models of Internet (Intellekt, Dolgoprudniy, 2013) [in Russian].

  12. L. A. Barabasi and R. Albert, “Emergence of scaling in random networks,’’ Science (Washington, DC, U. S.) 285, 509–512 (1999).

  13. J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Gharamani, ‘‘Kronecker graphs: An approach to modeling networks,’’ J. Mach. Learn. Res. 11, 985–1042 (2010).

  14. J. A. Anderson, Discrete Mathematics With Combinatorics (Prentice Hall, Englewood Cliffs, NJ, 2003).

  15. G. H. Hardy and S. Ramanujan, “Asymptotic formulae in combinatory analysis,’’ Proc. London Math. Soc. 17, 75–115 (1918).

  16. A. A. Kislitsyn and Yu. N. Orlov, “Investigation of the nearest neighbor graph statistics,’’ KIAM Preprint No. 85 (Keldysh Inst. Appl. Math., Moscow, 2021), pp. 1–23.

Download references

Funding

This work was supported by Russian Sciences Foundation, project no. 19-71-30004.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to A. A. Kislitsyn or Yu. N. Orlov.

Additional information

(Submitted by A. I. Aptekarev)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kislitsyn, A.A., Orlov, Y.N. Discussion about Properties of First Nearest Neighbor Graphs. Lobachevskii J Math 43, 3515–3524 (2022). https://doi.org/10.1134/S1995080222150148

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1995080222150148

Keywords:

Navigation