Abstract
We consider a class of random connected graphs with random vertices and random edges with the random distribution of vertices given by a Poisson point process with the intensity n localized at the vertices and the random distribution of the edges given by a connection function. Using the Avram-Bertsimas method constructed in 1992 for the central limit theorem on Euclidean functionals, we find the convergence rate of the central limit theorem process, the moderate deviation, and an upper bound for large deviations depending on the total length of all edges of the random connected graph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Grimmett, Percolation, Springer, Berlin (1999).
B. Bollobás and O. Riordan, Percolation, Cambridge Univ. Press, Cambridge (2006).
R. Meester and R. Roy, Continuum Percolation (Cambridge Tracts Math., Vol. 119), Cambridge Univ. Press, Cambridge (1996).
Z. H. Xu and Y. Higuchi, “A central limit theorem of random biased connected graphs [in Chinese],” Science in China Series A (Chinese version) (to appear 2012).
K. Kuulasmaa, J. Appl. Probab., 19, 745–758 (1982).
Z. H. Xu and D. Han, Chinese J. Appl. Probab. Statist., 26, 649–661 (2010).
M. D. Penrose, Random Geometric Graphs (Oxford Stud. Prob., Vol. 5), Oxford Univ. Press, Oxford (2003).
P. J. Bickel and L. Breiman, Ann. Probab., 11, 185–214 (1983).
D. Evans and A. J. Jones, Proc. Roy. Soc. London A, 458, 2759–2799 (2002).
N. Henze, Adv. Appl. Probab., 19, 873–895 (1987).
Z. H. Xu and Y. Higuchi, “A strong law of large numbers for random biased connected graphs,” Theor. Math. Phys., 172, No. 3 (2012).
L. Wu, Ann. Probab., 23, 420–445 (1995).
F. Avram and D. Bertsimas, Ann. Appl. Probab., 2, 113–130 (1992).
M. D. Penrose, Stochastic Process. Appl., 85, 295–320 (2000).
M. D. Penrose and J. E. Yukich, Ann. Appl. Probab., 13, 277–303 (2003).
P. Balister, B. Bollobás, A. Sarkar, and M. Walters, Adv. Appl. Probab., 37, 1–24 (2005).
S. H. Teng and F. F. Yao, Algorithmica, 49, 192–211 (2007).
J. M. Steel, Statistical Science, 8, 48–56 (1993).
P. Baldi and Y. Rinott, Ann. Probab., 17, 1646–1650 (1989).
H. Doering and P. Eichelsbacher, “Moderate deviations via cumulants,” arXiv:1012.5027v1 [math.PR] (2010).
Y. Baryshnikov, P. Eichelsbacher, T. Schreiber, and J. E. Yukich, Ann. Inst. Henri Poincaré Probab. Statist., 44, 422–446 (2008); arXiv:math/0603022v4 (2006).
S. Janson, Random Struct. Algorithms, 24, 234–248 (2004).
S. Janson, T. Łuczak, and A. Ruciński, Random Graphs, Wiley, New York (2000).
S. Janson and A. Ruciński, Random Struct. Algorithms, 20, 317–342 (2002).
F. Xue and P. R. Kumar, Wireless Networks, 10, 169–181 (2004).
Author information
Authors and Affiliations
Additional information
Prepared from an English manuscript submitted by the authors; for the Russian version, see Teoreticheskaya i Matematicheskaya Fizika, Vol. 172, No. 1, pp. 28–39, July, 2012.
Rights and permissions
About this article
Cite this article
Xu, Z., Higuchi, Y. & Hu, C. Limit behaviors of random connected graphs driven by a Poisson process. Theor Math Phys 172, 901–910 (2012). https://doi.org/10.1007/s11232-012-0085-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11232-012-0085-7