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.
Stevens Institute of Technology(史蒂文斯理工学院);State Key Laboratory for Novel Software Technology, Nanjing University(南京大学软件新技术国家重点实验室);Huazhong University of Science and Technology(华中科技大学);Computational Research Division, Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室计算研究部);Brookhaven National Laboratory(布鲁克海文国家实验室);Department of Computer Science & Engineering, University of Connecticut(康涅狄格大学计算机科学与工程系);Department of Electrical Engineering and Computer Science, University of California, Merced(加州大学默塞德分校电气与计算机工程系)