The connectivity of a graph on uniform points on [0,1]d
The connectivity of a graph on uniform points on [0,1]d
复制标题
DOI：
10.1016/s0167-7152(02)00233-x
复制
发表时间：
2002-12-15
影响因子：
0.8
通讯作者：
Russo, RP
中科院分区：
文献类型：
--
作者：
Appel, MJB;Russo, RP
随机图Gn（x）是在独立的随机点U-1，…，U-n在[0，1]（d）上均匀分布，d大于或等于1，其中两个不同的点通过一条边连接，如果它们之间的l（无穷大）-距离至多为某个规定值0无穷大，其中d（n）是G（n）（x）没有孤立点的最大最近邻链路，最小x。(C)2002 Elsevier Science B. V.保留所有权利。
A random graph Gn(x) is constructed on independent random points U-1,..., U-n distributed uniformly on [0,1](d), dgreater than or equal to1, in which two distinct such points are joined by an edge if the l(infinity)-distance between them is at most some prescribed value 0infinity, where d(n) is the largest nearest-neighbor link, the smallest x for which G(n)(x) has no isolated vertices. (C) 2002 Elsevier Science B.V. All rights reserved.