A strong law of large numbers for random biased connected graphs
A strong law of large numbers for random biased connected graphs
复制标题
随机偏置连通图的强大数定律
DOI：
10.1007/s11232-012-0106-6
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Y.Higuchi and C.H.Hu
中科院分区：
文献类型：
--
作者：
Z.H.Xu;Y.Higuchi and C.H.Hu
考虑一类具有随机顶点和随机边的随机连通图，其中顶点的随机性由连续概率分布决定，边的随机性由连接函数决定。对于有向k近邻图的推广，我们得到了关于随机有偏连通图所有随机边总长度的一个强大数定律。
We consider a class of random connected graphs with random vertices and random edges in which the randomness of the vertices is determined by a continuous probability distribution and the randomness of the edges is determined by a connection function. We derive a strong law of large numbers on the total lengths of all random edges for a random biased connected graph that is a generalization of a directed k-nearest-neighbor graph.