The Asymptotic Size of the Largest Component in Random Geometric Graphs with Some Applications

DOI10.1239/aap/1401369696zbMath1296.60259arXiv1311.0984OpenAlexW2964319422MaRDI QIDQ5169496

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

Publication date: 10 July 2014

Published in: Unnamed Author (Search for Journal in Brave)

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

zbMATH Keywords

percolationrandom geometric graphlargest componentnumber of open clustersPoison-Boolean model

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Related Items (1)

Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs

Cites Work

• Continuum percolation of wireless ad hoc communication networks
• A central limit theorem with applications to percolation, epidemics and Boolean models.
• Single linkage clustering and continuum percolation
• On a continuum percolation model
• Percolation
• Random Geometric Graphs
• Large deviations for discrete and continuous percolation
• Continuum Percolation

This page was built for publication: The Asymptotic Size of the Largest Component in Random Geometric Graphs with Some Applications