The bipartite kth nearest neighbor graphs B are studied. It is shown that B k 1 has a limiting expected matching number of approximately 80% of its vertices, that with high Ε½ . probability whp B has at least 2 log nr13 log log n vertices not matched, and that whp B 2 3 does have a perfect matching.
β¦ LIBER β¦
Nearest Neighbor Estimators for Random Fields
β Scribed by L.T. Tran; S. Yakowitz
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 635 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The random bipartite nearest neighbor gr
β
Boris Pittel; Robert S. Weishaar
π
Article
π
1999
π
John Wiley and Sons
π
English
β 301 KB
Symmetrized nearest neighbor regression
β
R.J Carroll; W HΓ€rdle
π
Article
π
1989
π
Elsevier Science
π
English
β 264 KB
Strong consistency of nearest neighbor r
β
Philip E Cheng
π
Article
π
1984
π
Elsevier Science
π
English
β 422 KB
Design Adaptive Nearest Neighbor Regress
β
Emmanuel Guerre
π
Article
π
2000
π
Elsevier Science
π
English
β 196 KB
This paper deals with nonparametric regression estimation under arbitrary sampling with an unknown distribution. The effect of the distribution of the design, which is a nuisance parameter, can be eliminated by conditioning. An upper bound for the conditional mean squared error of k&NN estimates lea
Multivariate k-nearest neighbor density
β
Y.P Mack; M Rosenblatt
π
Article
π
1979
π
Elsevier Science
π
English
β 583 KB
Asymptotic confidence bands for densitie
β
Jan Mielniczuk
π
Article
π
1987
π
Elsevier Science
π
English
β 193 KB