Connectivity in random key graphs – Simple proofs for special cases

Loading...
Thumbnail Image

Files

Publication or External Link

Date

2009-01-14

Advisor

Citation

DRUM DOI

Abstract

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 connectivity, and provide simple proofs for some special cases.

Notes

Rights