Percolation in the secrecy graph

DOI10.1016/j.dam.2013.03.022zbMath1286.05157arXiv1107.4613OpenAlexW2546255323MaRDI QIDQ2446856

M. Haenggi, Amites Sarkar

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

percolationbranching processsecrecy graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (7)

Continuum percolation with holes ⋮ 1‐independent percolation on ℤ2×Kn ⋮ On the critical threshold for continuum AB percolation ⋮ Long paths and connectivity in 1‐independent random graphs ⋮ Continuum AB percolation and AB random geometric graphs ⋮ Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph ⋮ Law of large numbers for a two-dimensional class cover problem

Cites Work

• Uniqueness and non-uniqueness in percolation theory
• On continuum percolation
• Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation
• Density and uniqueness in percolation
• Uniqueness of unbounded occupied and vacant components in Boolean models
• Continuum percolation and Euclidean minimal spanning trees in high dimensions
• Percolation
• Random Plane Networks
• Probability with Martingales
• Nearest neighbor and hard sphere models in continuum percolation
• Continuum Percolation
• Continuum percolation with steps in the square or the disc
• Unnamed Item
• Unnamed Item

This page was built for publication: Percolation in the secrecy graph