Zero-one laws for connectivity in random key graphs
Abstract
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 for graph connectivity.