Zero-one laws for connectivity in random key graphs
Zero-one laws for connectivity in random key graphs
Files
Publication or External Link
Date
2009-01-14
Authors
Yagan, Osman
Makowski, Armand
Advisor
Citation
DRUM DOI
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.