Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-26T07:02:38.879Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Part of: Special processes Equilibrium statistical mechanics Geometric probability and stochastic geometry

Published online by Cambridge University Press:  22 February 2016

Ge Chen ,
Changlong Yao  and
Tiande Guo
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: [email protected]
∗∗ Postal address: Institute of Applied Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, P. R. China. Email address: [email protected]
∗∗∗ Postal address: School of Mathematical Science, University of Chinese Academy of Sciences, Beijing, 100049, P. R. China. Email address: [email protected]
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.

Keywords

Random geometric graphpercolationlargest componentPoisson-Boolean modelnumber of open clusters

MSC classification

Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory
Secondary: 60D05: Geometric probability and stochastic geometry 82B43: Percolation
Type
Stochastic Geometry and Statistical Applications
Information
Advances in Applied Probability , Volume 46 , Issue 2 , June 2014 , pp. 307 - 324
Copyright
© Applied Probability Trust 

References

Glauche, I., Krause, W., Sollacher, R. and Greiner, M. (2003). Continuum percolation of wireless ad hoc communication networks. Physica A 325, 577–600.Google Scholar
Grimmett, G. (1999). Percolation, 2nd edn. Springer, Berlin.Google Scholar
Hekmat, R. and Van Mieghem, P. (2006). Connectivity in Wireless Ad Hoc Networks with a Log-normal Radio Model. Mobile Networks Appl. 11, 351–360.Google Scholar
Jiang, J., Zhang, S. and Guo, T. (2010). A convergence rate in a martingale CLT for percolation clusters. J. Graduate School Chinese Acad. Sci. 27, 577–583.Google Scholar
Meester, R. and Roy, R. (1996). Continuum Percolation. Cambridge University Press.Google Scholar
Penrose, M. D. (1991). On a continuum percolation model. Adv. Appl. Prob. 23, 536–556.Google Scholar
Penrose, M. D. (1995). Single linkage clustering and continuum percolation. J. Multivariate Anal. 53, 94–109.Google Scholar
Penrose, M. D. (2001). A central limit theorem with applications to percolation, epidemics and Boolean models. Ann. Prob. 29, 1515–1546.CrossRefGoogle Scholar
Penrose, M. D. (2003). Random Geometric Graphs. Oxford University Press.CrossRefGoogle Scholar
Penrose, M. D. and Pisztora, A. (1996). Large deviations for discrete and continuous percolation. Adv. Appl. Prob. 28, 29–52.Google Scholar
Pishro-Nik, H., Chan, K. and Fekri, F. (2009). Connectivity properties of large-scale sensor networks. Wireless Networks 15, 945–964.Google Scholar
Ta, X., Mao, G. and Anderson, B. D. O. (2009). On the giant component of wireless multihop networks in the presence of shadowing. IEEE Trans. Vehicular Tech. 58, 5152–5163.Google Scholar