Zero-one laws for connectivity in random key graphs

Thumbnail
View/Open
Date
2009-01-14
Author
Yagan, Osman
Makowski, Armand
Metadata
Show full item record
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.
URI
http://hdl.handle.net/1903/8716
Collections