Abstract
In this paper the investigation of the structure of k-NN graph is presented. The purpose of this analysis is to match the probability of implementation particular graph under assumption of a certain distribution of distances between vertices and depending on the number of vertices. Sample distributions of the graph by the number of disconnected fragments, fragments by the number of vertices, and vertices by the degrees of incoming edges are used as the main statistics. As an example, the problem of identifying the author of a text by the n-gram method is considered.
Publisher
Keldysh Institute of Applied Mathematics
Reference13 articles.
1. Hastie T., Tibshirani R., Friedman J. The Elements of Statistical Learning. – Springer, 2001. – 764 p.
2. Erdos P., Renyi A. On random graphs I // Publ. Math. Debrecen, 1959. V. 6. P. 290-297.
3. Колчин В.Ф. Случайные графы. – М.: Физматлит, 2004. – 256 c.
4. Bollobas B. Random Graphs. – Cambridge University Press, 2001. – 520 p.
5. Janson S., Luczak T., Rucinski A. Random graphs. – New York: Wiley, 2000. – 333 p.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献