Zero-one law for connectivity in superposition of random key graphs on random geometric graphs

DOI10.1155/2015/982094zbMath1420.05163OpenAlexW2179240077WikidataQ59105612 ScholiaQ59105612MaRDI QIDQ1723597

Xianqiang Yang

Publication date: 19 February 2019

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/982094

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Related Items (1)

Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Connectivity of the uniform random intersection graph
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols
• Random Geometric Graphs
• Performance of the Eschenauer–Gligor Key Distribution Scheme Under an ON/OFF Channel
• Zero–One Laws for Connectivity in Random Key Graphs

This page was built for publication: Zero-one law for connectivity in superposition of random key graphs on random geometric graphs