On k-connectivity for a geometric random graph
暂无分享,去创建一个
[1] D. Klarner. Cell Growth Problems , 1967, Canadian Journal of Mathematics.
[2] R. F. Ling. A Probability Theory of Cluster Analysis , 1973 .
[3] Lars Holst,et al. On multiple covering of a circle with random arcs , 1980, Journal of Applied Probability.
[4] J. Hartigan. Consistency of Single Linkage for High-Density Clusters , 1981 .
[5] Norbert Henze. The limit distribution for maxima of ‘weighted' rth-nearest-neighbour distances , 1982 .
[6] N. Henze,et al. Some peculiar boundary phenomena for extremes of rth nearest neighbor links , 1990 .
[7] Martin J. B. Appel,et al. The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1] d , 1997, Advances in Applied Probability.
[8] M. Penrose. The longest edge of the random minimal spanning tree , 1997 .