Yagan, OsmanMakowski, ArmandWe 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.en-USWireless sensor networksZero-one lawsKey predistributionRandom key graphConnectivityArticle