Search
Now showing items 1-3 of 3
Zero-one laws for connectivity in random key graphs
(2009-01-14)
The random key graph is a random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law ...
Connectivity in random key graphs – Simple proofs for special cases
(2009-01-14)
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph ...
On the existence of triangles in random key graphs
(2009-07-04)
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 ...