Some properties for the largest component of random geometric graphs with applications in sensor networks

DOI10.1007/s10255-008-8809-zzbMath1250.60012OpenAlexW2073616772MaRDI QIDQ1048237

Ge Chen, Chang-long Yao, Tian-de Guo

Publication date: 11 January 2010

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

Full work available at URL: https://doi.org/10.1007/s10255-008-8809-z

zbMATH Keywords

random geometric graphwireless sensor networkstopology controlthe largest component

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Applications of statistics in engineering and industry; control charts (62P30)

Related Items

Concentration for Poisson functionals: component counts in random geometric graphs

Cites Work

• Unnamed Item
• Two moments suffice for Poisson approximations: The Chen-Stein method
• Efficient measurement of the percolation threshold for fully penetrable discs
• On a continuum percolation model
• Random Plane Networks
• Random Geometric Graphs
• Continuum Percolation