arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.03758cs.SIcs.DMmath.PR
收藏

计数三角形,可调聚类和随机密钥图中的小世界属性(扩展版)

Counting triangles, tunable clustering and the small-world property in random key graphs (Extended version)

Osman Yağan, Armand M. Makowski

摘要:

通过引入随机密钥图,研究了无线传感器网络(WSNs)中的M-G密钥预分配方案的各种性质.最近,这类随机图在推荐系统、社会网络建模、聚类和分类分析等不同的背景下受到了广泛的关注。本文研究了随机密钥图的各种性质。特别地,我们建立了随机密钥图中三角形存在的0 - 1定律,并确定了相应的临界标度。该零-一定律与Erdos-Renyi(ER)图中的相应结果存在显著差异。我们还计算了随机密钥图的聚类系数,并将其与ER图在多节点状态下的聚类系数进行了比较,当它们的期望平均度渐近等价时。对于无线传感器网络和社交网络应用中实际相关的参数范围,随机密钥图比相应的ER图更加聚类。我们还探讨了适合的随机密钥图作为小世界模型的意义上的瓦茨和Strogatz。

英文摘要:

Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse as recommender systems, social network modeling, and clustering and classification analysis. This paper is devoted to analyzing various properties of random key graphs. In particular, we establish a zero-one law for the the existence of triangles in random key graphs, and identify the corresponding critical scaling. This zero-one law exhibits significant differences with the corresponding result in Erdos-Renyi (ER) graphs. We also compute the clustering coefficient of random key graphs, and compare it to that of ER graphs in the many node regime when their expected average degrees are asymptotically equivalent. For the parameter range of practical relevance in both wireless sensor network and social network applications, random key graphs are shown to be much more clustered than the corresponding ER graphs. We also explore the suitability of random key graphs as small world models in the sense of Watts and Strogatz.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑