This article is cited in 1 paper

Limit behaviors of random connected graphs driven by a Poisson process

Zhonghao Xu^a, Yasunari Higuchi^b, Chunhua Hu<sup>c

a</sup> School of Finance and Statistics, East China Normal University, Shanghai, China
^b Department of Mathematics, Kobe University, Kobe, Japan
^c School of Applied Mathematics, Beijing Normal University, Zhuhai, China

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.

Keywords: random connected graph, dependency graph, central limit theorem, moderate deviation, large deviation.

Received: 30.08.2011
Revised: 11.11.2011

DOI: 10.4213/tmf6938

 English version: Theoretical and Mathematical Physics, 2012, 172:1, 901–910

Bibliographic databases:

• 
• 
• 
• 
•