On the existence of triangles in random key graphs
On the existence of triangles in random key graphs
Loading...
Files
Publication or External Link
Date
Authors
Advisor
Citation
DRUM DOI
Abstract
The random key graph, also known as the uniform random intersection graph, is a 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 appearance of triangles in random key graphs by applying the method of first and second moments to the number of triangles in the graph.