Institute for Systems Research

Permanent URI for this communityhttp://hdl.handle.net/1903/4375

Browse

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    Item
    On the random graph induced by a randomized predistribution scheme under full visibility (Extended version)
    (2008) Yagan, Osman; Makowski, Armand M.
    We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the absence of isolated nodes, and complement it by a Poisson convergence for the number of isolated nodes. Leveraging earlier resu lts and analogies with Erd\H{o}s-Renyi graphs, we explore similar results for the property of graph connectivity. Implications for secure connectivity are discussed.