Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs

摘要

We study connectivity property in the superposition of random key graph on random geometricgraph. For this class of random graphs, we establish a new version of a conjectured zero-one lawfor graph connectivity as the number of nodes becomes unboundedly large. The results reported herestrengthen recent work by the Krishnan et al.