Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T09:33:45.101Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  22 February 2016

Ge Chen*
Affiliation:
Chinese Academy of Sciences
Changlong Yao*
Affiliation:
Chinese Academy of Sciences
Tiande Guo*
Affiliation:
Chinese Academy of Sciences
*
∗ Postal address: National Center for Mathematics and Interdisciplinary Sciences and Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, P. R. China. Email address: chenge@amss.ac.cn
∗∗ Postal address: Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, P. R. China. Email address: deducemath@126.com
∗∗∗ Postal address: School of Mathematical Science, University of Chinese Academy of Sciences, Beijing, 100049, P. R. China. Email address: tdguo@ucas.ac.cn
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we estimate the expectation of the size of the largest component in a supercritical random geometric graph; the expectation tends to a polynomial on a rate of exponential decay. We sharpen the expectation's asymptotic result using the central limit theorem. Similar results can be obtained for the size of the biggest open cluster, and for the number of open clusters of percolation on a box, and so on.

Information

Type
Stochastic Geometry and Statistical Applications
Copyright
© Applied Probability Trust