Percolation and Connectivity in the Intrinsically Secure Communications Graph

DOI10.1109/TIT.2011.2173726zbMath1365.94033arXiv1008.4161MaRDI QIDQ5272060

Moe Z. Win, Pedro Pinto

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/1008.4161

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Percolation (82B43) Information theory (general) (94A15) Communication theory (94A05) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (3)

On the critical threshold for continuum AB percolation ⋮ Continuum AB percolation and AB random geometric graphs ⋮ Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph

This page was built for publication: Percolation and Connectivity in the Intrinsically Secure Communications Graph