Connectivity in random graphs induced by a key predistribution scheme - small key pools
Osman Yağan, Armand M. Makowski · 2010
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 small key pools.