The coverage holes of the largest component of random geometric graph

DOI10.1007/S10255-015-0515-ZMaRDI QIDQ277050zbMATH OpenOpenAlexFDO

Authors Chang-long Yao, Tiande Guo

Publication date 4 May 2016

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-015-0515-z

zbMATH Keywords

continuum percolationcoveragerandom geometric graphwireless sensor networks

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Recommendations

• The coverage of the largest component in random geometric graphs with applications in sensor networks
• Some properties for the largest component of random geometric graphs with applications in sensor networks
• Thresholding random geometric graph properties motivated by ad hoc sensor networks
• The Asymptotic Size of the Largest Component in Random Geometric Graphs with Some Applications
• The bin-covering technique for thresholding random geometric graph properties

Cites work

• scientific article; zbMATH DE number 6783404 (Why is no real title available?)
• Co-Existence of the occupied and vacant phase in boolean models in three or more dimensions
• Continuum Percolation
• Large deviations for the graph distance in supercritical continuum percolation
• Percolation
• Random Geometric Graphs
• Random Networks for Communication
• Sentry selection in wireless networks
• The coverage of the largest component in random geometric graphs with applications in sensor networks

Cited in

(5)

• Thresholding random geometric graph properties motivated by ad hoc sensor networks
• Some properties for the largest component of random geometric graphs with applications in sensor networks
• The coverage of the largest component in random geometric graphs with applications in sensor networks
• Continuum percolation with holes
• The size of the largest hole in a random graph

This page was built for publication: The coverage holes of the largest component of random geometric graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q277050)