Title :
On the existence of triangles in random key graphs
Author :
Osman Yağan;Armand M. Makowski
Author_Institution :
Department of Electrical and Computer Engineering and Institute for Systems Research University of Maryland, College Park, MD 20742
Abstract :
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law for the appearance of triangles, and identify the corresponding critical scaling. This is done by applying the method of first and second moments to the number of triangles in the graph.
Keywords :
"Wireless sensor networks","Educational institutions","Recommender systems","Cryptography","Communication system security","Context modeling","H infinity control","Random variables"
Conference_Titel :
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Print_ISBN :
978-1-4244-5870-7
DOI :
10.1109/ALLERTON.2009.5394489
