On the random graph induced by a random key predistribution scheme under full visibility
On the random graph induced by a random key predistribution scheme under full visibility
复制标题
全可见下随机密钥预分配方案导出的随机图
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
A. Makowski
中科院分区：
文献类型：
--
作者：
Osman Yağan;A. Makowski
我们在完全可见性的假设下考虑由 Eschenauer 和 Gligor 的随机密钥预分配方案导出的随机图。我们证明了不存在孤立节点时存在零一定律，并通过孤立节点数量的泊松收敛来补充它。利用早期的结果以及与鄂尔多斯-仁义图的类比，我们探索了图连通性属性的类似结果。
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the absence of isolated nodes, and complement it by a Poisson convergence for the number of isolated nodes. Leveraging earlier results and analogies with Erdos-Renyi graphs, we explore similar results for the property of graph connectivity.