Zero–One Laws for Connectivity in Random Key Graphs

DOI10.1109/TIT.2011.2181331zbMath1365.60004arXiv0908.3644OpenAlexW2041282222MaRDI QIDQ5271965

Osman Yaǧan, Armand M. Makowski

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.3644

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Cryptography (94A60) Combinatorial probability (60C05) Zero-one laws (60F20)

Related Items (8)

On Some Combinatorial Properties of Random Intersection Graphs ⋮ \(k\)-connectivity of uniform \(s\)-intersection graphs ⋮ Phase transition in random intersection graphs with communities ⋮ Perfect matchings in random intersection graphs ⋮ Zero-one law for connectivity in superposition of random key graphs on random geometric graphs ⋮ Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter

This page was built for publication: Zero–One Laws for Connectivity in Random Key Graphs